Rationality in Algebras with a Series Operation

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

[1]  Bruno Courcelle,et al.  Basic Notions of Universal Algebra for Language Theory and Graph Grammars , 1996, Theor. Comput. Sci..

[2]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[3]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[4]  B. Courcelle.  On Recognizable Sets and Tree Automata , 1989 .

[5]  Jesse B. Wright,et al.  Automata in General Algebras , 1967, Inf. Control..

[6]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  Pascal Weil,et al.  A Kleene Iteration for Parallelism , 1998, FSTTCS.

[9]  Dietrich Kuske,et al.  Infinite Series-Parallel Posets: Logic and Languages , 2000, ICALP.

[10]  Dirk Siefkes,et al.  Finite Automata, Their Algebras and Grammars , 1990 .

[11]  Dietrich Kuske,et al.  Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets , 2000, CONCUR.

[12]  Denis Lapoire,et al.  Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[13]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[14]  Zoltán Ésik,et al.  Free Shuffle Algebras in Language Varieties , 1996, Theor. Comput. Sci..

[15]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[16]  Zoltan Esik.  Free algebras for generalized automata and language theory (Algebraic Systems, Formal Languages and Computations) , 2000 .

[17]  E. Polak,et al.  System Theory , 1963 .

[18]  Pascal Weil,et al.  Series-Parallel Posets: Algebra, Automata and Languages , 1998, STACS.

[19]  Dietrich Kuske,et al.  A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets , 2001, STACS.

[20]  Julius Richard Büchi,et al.  Finite automata, their algebras and grammars - towards a theory of formal expressions , 1989 .

[21]  Pascal Weil,et al.  Series-parallel languages and the bounded-width property , 2000, Theor. Comput. Sci..

[22]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[23]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.