MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Free shuffle algebras in language varieties
Theoretical Computer Science
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Finite Automata, Their Algebras and Grammars
Finite Automata, Their Algebras and Grammars
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Kleene Iteration for Parallelism
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Parameterized Complexity
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
A hierarchy theorem for regular languages over free bisemigroups
Acta Cybernetica
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Axiomatizing the identities of binoid languages
Theoretical Computer Science
Acta Cybernetica
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Definable transductions and weighted logics for texts
Theoretical Computer Science
Branching automata with costs: a way of reflecting parallelism in costs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Series-parallel languages on scattered and countable posets
Theoretical Computer Science
Series-parallel languages on scattered and countable posets
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.01 |
We consider the notion of rationality in algebras with a designated binary associative operation called the series operation, or the sequential product. We define automata operating in these algebras and rational expressions matching their expressive power, and we show that this expressive power equals that of algebraic recognizability. The framework which we consider encompasses both the free semigroup and the term algebras and the restriction of our results to these special cases coincides exactly with the classical results on recognizability (Kleene, Myhill, and Nerode for word languages, and Thatcher and Wright for term languages). Next we consider the behavior of the automata and the rational expression which we introduce when conditions such as associativity and commutativity are imposed on the term operations. We also characterize algebraically, syntactically and automata-theoretically the languages which have a bound on the number of nested occurrences of certain designated term operations. Finally, we consider the applications of our results to the languages of series-parallel labelled posets. 2001 Elsevier Science