Abstract
PDF (207 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (9)
is bounded. Such semigroups are described first in terms of identities and then structurally as nilpotent extensions of semilattices, Boolean groups and rectangular bands. As a corollary it is shown that if 
doi:10.1006/inco.2001.3077 
Copyright © 2001 Elsevier Science (USA). All rights reserved.
Regular Article
Rationality in Algebras with a Series Operation*1
Received 22 February 2000.
Abstract
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.
References
1. Autebert, J.-M., Berstel, J., and Boasson, L.1997, Context-free languages and pushdown automata, inHandbook of Formal LanguagesG. Rozenberg and A. Salomaa, Eds., Vol. 1, Springer-Verlag, Berlin.
2. S. Bloom and Z. Ésik, Free shuffle algebras in language varieties. Theoret. Comput. Sci. 163 (1996), pp. 55–98. Abstract | 
PDF (2552 K)
| View Record in Scopus | Cited By in Scopus (24)
3. Büchi, J. R.1989, Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal ExpressionsD. Siefkes, Ed., Springer-Verlag, Berlin.
4. Courcelle, B.1989, On recognizable sets and tree automata, inResolution of Equations in Algebraic StructuresH. Aït-Kaci and M. Nivat, Eds., pp. 93–126, Academic Press, San Diego.
5. B. Courcelle, The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoret. Comput. Sci. 80 (1991), pp. 153–202. Abstract | PDF (1820 K)
| View Record in Scopus | Cited By in Scopus (22)
6. B. Courcelle, Basic notions of universal algebra for language theory and graph grammars. Theoret. Comput. Sci. 163 (1996), pp. 1–54. Abstract | PDF (3665 K)
| View Record in Scopus | Cited By in Scopus (12)
7. Downey, R, and, Fellows, M. R. 1999, Parameterized Complexity, Springer-Verlag, Berlin.
8. S. Eilenberg and J. Wright, Automata in general algebras. Inform. and Control 11 (1967), pp. 52–70.
9. Ésik, Z.2000, Free algebras for generalized automata and language theory, inAlgebraic Systems, Formal Languages and ComputationsM. Ito, Ed., Vol. 1116, pp. 52–58, RIMS Publications.
10. Gécseg, F., and Steinby, M.1996, Tree languages, inHandbook of Formal Language TheoryG. Rozenberg and A. Salomaa, Eds., Vol. 3, Springer-Verlag, Berlin.
11. J. Grabowski, On partial languages. Fund. Inform. IV (1981), pp. 427–498.
12. Kuske, D.2000, Infinite series-parallel pomsets: Logic and languages, inICALP 2000U. Montanariet al., Eds., Lecture Notes in Computer Science, Vol. 1853, pp. 648–662, Springer-Verlag, Berlin.
13. Kuske, D.2001, A model theoretic proof of Büchi-type theorems and first order logic for N-free pomsets, inSTACS 2001A. Ferreira and H. Reichel, Eds., Lecture Notes in Computer Science, Vol. 2010, Springer-Verlag, Berlin.
14. Lapoire, D.1998, Recognizability equals monadic second-order definability for sets of graphs of bounded treewidth, inSTACS 98M. Morvan, Ch. Meinel, and D. Krob, Eds., Lecture Notes in Computer Science, Vol. 1373, pp. 618–628, Springer-Verlag, Berlin.
15. Lodaya, K., and Weil, P.1998, Series-parallel posets: Algebra, automata and languages, inSTACS 98M. Morvan, Ch. Meinel, and D. Krob, Eds., Lecture Notes in Computer Science, Vol. 1373, pp. 555–565, Springer-Verlag, Berlin.
16. Lodaya, K., and Weil, P.1998, A Kleene iteration for parallelism, inFST & TCS 98V. Arvind and R. Ramanujam, Eds., Lecture Notes in Computer Science, Vol. 1530, pp. 355–366, Springer-Verlag, Berlin.
17. K. Lodaya and P. Weil, Series-parallel languages and the bounded-width property. Theoret. Comput. Sci. 237 (2000), pp. 347–380. Abstract | PDF (278 K)
| View Record in Scopus | Cited By in Scopus (17)
18. J. Mezei and J. Wright, Algebraic automata and context-free sets. Inform. and Control 11 (1967), pp. 3–29. Abstract | PDF (1352 K)
| View Record in Scopus | Cited By in Scopus (43)
19. J. W. Thatcher and J. B. Wright, Generalized finite automata with an application to a decision problem of second order logic. Math. System Theor. 2 (1968), pp. 57–82.
20. J. Valdes, R. E. Tarjan and E. L. Lawler, The recognition of series-parallel digraphs. SIAM J. Comput. 11 (1981), pp. 298–313.
