Partial Commutations and Faithful Rational Transductions

Etude de l'operation de commutation partielle relative aux autres operations telles que la commutation partagee, le shuffle jumeau, l'intersection et les transductions rationnelles fideles. A partir de cette etude, on donne une caracterisation tres simple pour les familles de langages suivantes: Multi-Reset, BNP et Q, la famille des langages quasi-temps reel

[1]  Miklos Szijarto.  A classification and closure properties of languages for describing concurrent system behaviours , 1981, Fundam. Informaticae.

[2]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[3]  Alberto Bertoni,et al.  A hierarchy of regular trace languages and some combinatorial applications , 1982 .

[4]  Karel Culik.  A Purely Homomorphic Characterization of Recursively Enumerable Sets , 1979, JACM.

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

[6]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[7]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[8]  Ronald V. Book,et al.  Reversal-Bounded Acceptors and Intersections of Linear Languages , 1974, SIAM J. Comput..

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

[10]  Jeannine Leguy.  Transductions Rationnelles Décroissantes , 1981, RAIRO Theor. Informatics Appl..

[11]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[12]  Giancarlo Mauri,et al.  Equivalence and Membership Problems for Regular Trace Languages , 1982, ICALP.

[13]  Elöd Knuth.  Cycles of Partial Orders , 1978, MFCS.

[14]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[15]  Sheila A. Greibach,et al.  The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.