Series-parallel posets: Algebra, automata and languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 555-565

  Lodaya, K ^a   Weil, P ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

KLEENE THEOREM; LINEAR ORDER; MYHILL-NERODE THEOREM; NATURAL GENERALIZATION; NILPOTENT; RATIONAL EXPRESSIONS; SERIES-PARALLEL; TWO-PRODUCT; WORD LANGUAGES;

ALGEBRA; COMPUTER SCIENCE; SET THEORY; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 78649838873     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028590     Document Type: Conference Paper

References (14)

1. L. Aceto. Full abstraction for series-parallel pomsets, in Proc. TAPSOFT 91, LNCS 493, Springer (1991) 1-40.
2. G. Boudol and I. Castellani. Concurrency and atomicity, TCS 59 (1988) 25-84.
3. S. Bloom and Z. Ésik. Free shuffle algebras in language varieties, TCS 163 (1996) 55-98.
4. J.R. Büchi. Finite automata, their algebras and grammars: Towards a theory of formal expressions (D. Siefkes, ed.), Springer (1989).
5. B. Courcelle. Graph rewriting: an algebraic and logical approach, in Handbook of Theoretical Computer Science B (J. van Leeuwen, ed.), Elsevier (1990) 193-242.
6. V. Diekert and G. Rozenberg. The book of traces, World Scientific (1995).
7. J.L. Gischer. The equational theory of pomsets, TCS 61 (1988) 199-224.
8. J. Grabowski. On partial languages, Fund. Inform. IV (1981) 427-498.
9. R. Milner. A complete inference system for a class of regular behaviours, JCSS 28 (1984) 439-466.
10. J.-E. Pin. Syntactic semigroups, in Handbook of Formal Language Theory 1 (G. Rozenberg and A. Salomaa, eds.), Springer (1997) 679-746.
11. V. Pratt. Modelling concurrency with partial orders, IJPP 15(1) (1986) 33-71.
12. W. Reisig. Petri nets, an introduction, Springer (1985).
13. J.W. Thatcher and J.B. Wright. Generalized finite automata with an application to a decision problem of second order logic, Math. Syst. Theory 2 (1968) 57-82.
14. J. Valdes, R.E. Tarjan and E.L. Lawler. The recognition of series-parallel digraphs, SIAM J. Comput. 11(2) (1981) 298-313.