Sciweavers

644 search results - page 26 / 129
» Precedence Automata and Languages
Sort
View
CONCUR
2003
Springer
15 years 4 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
LICS
2002
IEEE
15 years 4 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
COMSIS
2010
14 years 8 months ago
On automata and language based grammar metrics
Abstract. Grammar metrics have been introduced to measure the quality and the complexity of the formal grammars. The aim of this paper is to explore the meaning of these notions an...
Matej Crepinsek, Tomaz Kosar, Marjan Mernik, Julie...
CONCUR
2008
Springer
15 years 1 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
ACTA
2005
96views more  ACTA 2005»
14 years 11 months ago
Families of automata characterizing context-sensitive languages
In the hierarchy of infinite graph families, rational graphs are defined by rational transducers with labelled final states. This paper proves that their traces are precisely conte...
Christophe Morvan, Chloe Rispal