Rationality in algebras with a series operation

Information and Computation

Volumn 171, Issue 2, 2001, Pages 269-293

  Lodaya, K ^a   Weil, P ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ASSOCIATIVE PROCESSING; CONTEXT FREE LANGUAGES; GRAPH THEORY; SET THEORY; SYNTACTICS;

SERIES OPERATION;

AUTOMATA THEORY;

EID: 0035895139     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3077     Document Type: Article

References (20)

1. Autebert, J.-M., Berstel, J., and Boasson, L. (1997), Context-free languages and pushdown automata, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 1, Springer-Verlag, Berlin.
2. Bloom, S., and Ésik, Z. (1996), Free shuffle algebras in language varieties, Theoret. Comput. Sci. 163, 55-98.
3. Büchi, J. R. (1989), "Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions" (D. Siefkes, Ed.), Springer-Verlag, Berlin.
4. Courcelle, B. (1989), On recognizable sets and tree automata, in "Resolution of Equations in Algebraic Structures" (H. Aït-Kaci and M. Nivat, Eds.), pp. 93-126, Academic Press, San Diego.
5. Courcelle, B. (1991), The monadic second-order logic of graphs V: On closing the gap between definability and recognizability, Theoret. Comput. Sci. 80, 153-202.
6. Courcelle, B. (1996), Basic notions of universal algebra for language theory and graph grammars, Theoret. Comput. Sci. 163, 1-54.
7. Downey, R., and Fellows, M. R. (1999), "Parameterized Complexity," Springer-Verlag, Berlin.
8. Eilenberg, S., and Wright, J. (1967), Automata in general algebras, Inform. and Control 11, 52-70.
9. Ésik, Z. (2000), Free algebras for generalized automata and language theory, in "Algebraic Systems, Formal Languages and Computations" (M. Ito, Ed.), Vol. 1116, pp. 52-58, RIMS Publications.
10. Gécseg, F., and Steinby, M. (1996). Tree languages, in "Handbook of Formal Language Theory" (G. Rozenberg and A. Salomaa, Eds.), Vol. 3, Springer-Verlag, Berlin.
11. Grabowski, J. (1981), On partial languages, Fund. Inform. IV, 427-498.
12. Kuske, D. (2000), Infinite series-parallel pomsets: Logic and languages, in "ICALP 2000" (U. Montanari et 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, in "STACS 2001" (A. 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, in "STACS 98" (M. 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, in "STACS 98' (M. 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, in "FST & TCS 98" (V. Arvind and R. Ramanujam, Eds.), Lecture Notes in Computer Science, Vol. 1530, pp. 355-366, Springer-Verlag, Berlin.
17. Lodaya, K., and Weil, P. (2000). Series-parallel languages and the bounded-width property, Theoret. Comput. Sci. 237, 347-380.
18. Mezei, J., and Wright, J. (1967), Algebraic automata and context-free sets, Inform. and Control 11, 3-29.
19. Thatcher, J. W., and Wright, J. B. (1968), Generalized finite automata with an application to a decision problem of second order logic, Math. System Theor. 2, 57-82.
20. Valdes, J., Tarjan, R. E., and Lawler, E. L. (1981), The recognition of series-parallel digraphs, SIAM J. Comput. 11, 298-313.