An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
Laura Giambruno; Antonio Restivo
RAIRO - Theoretical Informatics and Applications (2008)
- Volume: 42, Issue: 3, page 503-524
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- J. Berstel and D. Perrin. Theory of Codes. Academic Press (1985).
- V. Bruyére, D. Derencourt, M. Latteux. The meet operation in the lattice of codes. Theoretical Computer Science191 (1998) 117–129.
- J. Clement, J. Duval, G.Guaiana, D. Perrin, G. Rindone. Paarsing with a finite dictionary. Theoretical Computer Science340 (2005) 432–442.
- H.Cormen, E. Leiserson, L. Rivest. Introduction to Algorithms. The MIT Press (1990).
- J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Weisley Publishing Company (1979).
- A.G. Howson. On the intersection of finitely generated free groups. J. London Math. Soc.29 (1954) 428–434.
- J. Karhumäki. A note on intersection of free submonoids of a free monoid. Semigroup Forum29 (1984) 183–205.
- M. Latteux and J. Leguy. On the composition of morphism and inverse morphisms. Lecture Notes in Computer Science154 (1983) 420–432.
- J. Meakin and P. Weil. Sugroups of free groups: a contribution to the Hanna Neumann conjecture. Geometriae Dedicata94 (2002) 33–43.
- H. Neumann. On intersections of finitely generated subgroups of free groups. Publ. Math. Debrecen4 (1956) 186–189.
- W.D. Neumann. On intersections of finitely generated subgroups of free groups. Lect. Notes Math.1456 (1990) 161–170.
- B. Tilson. The intersection of free submonoids of a free monoid is free. Semigroup Forum4 (1972) 345–350.