On free inverse monoid languages

 Access to full text

 Full (PDF)

1. 1. J. BERSTEL, Transductions and Context-free Languages, Teubner Studienbücher, 1979. Zbl0424.68040MR549481
2. 2. S. EILENBERG, Automata, Languages and Machines (Vol. A), Academic Press, 1974. Zbl0317.94045MR530382
3. 3. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969. Zbl0196.01701MR237243
4. 4. J. M. HOWIE, An Introduction to Semigroup Theory, Academic Press, 1976. Zbl0355.20056MR466355
5. 5. B. LE SAËC, I. LITOVSKY and B. PATROU, Recognizability of zigzag languages and stack languages, preprint. Zbl0923.68082MR1477730
6. 6. S. W. MARGOLIS and J. C. MEAKIN, E-unitary inverse monoids and the Cayley graph of a group presentation, J. Pure Appl. Alg., 1989, 58, pp. 45-76. Zbl0676.20037MR996174
7. 7. S. W. MARGOLIS and J. C. MEAKIN, Free inverse monoids and graph immersions, Int. J. Alg. Comp., 1993, 3.1, pp. 79-100. Zbl0798.20056MR1214007
8. 8. S. W. MARGOLIS and J. C. MEAKIN, Inverse monoids and rational Schreier subsets of the free group, Sem. Forum, 1992, 44, pp. 137-148. Zbl0757.20017MR1141834
9. 9. S. W. MARGOLIS and J. C. MEAKIN, Inverse monoids, trees and context-free languages, Trans. Amer. Math. Soc., 1993, 335, (1), pp. 259-276. Zbl0795.20043MR1073775
10. 10. P. R. JONES, S. W. MARGOLIS, J. C. MEAKIN and J. B. STEPHEN, Free products of inverse semigroups II, Glasgow Math. J., 1991, 33, pp. 373-387. Zbl0742.20057MR1127530
11. 11. W. D. MUNN, Free inverse semigroups, Proc. London Math. Soc., 1974, (3), 29, pp. 385-404. Zbl0305.20033MR360881
12. 12. M. PETRICH, Inverse Semigroups, Wiley 1984. Zbl0546.20053MR752899
13. 13. J.-P. SERRE, Trees, Springer-Verlag, 1980. Zbl0548.20018MR607504
14. 14. P. V. SILVA, Rational languages and inverse monoid presentations, Int. J. Alg. Comp., 1992, pp. 187-207. Zbl0777.20023MR1176384
15. 15. J. B. STEPHEN, Presentations of inverse monoids, J. Pure Appl. Alg., 1990, 63, pp. 81-112. Zbl0691.20044MR1037695

1. Pedro V. Silva, Free group languages : rational versus recognizable
2. Pierre-Cyrille Héam, A lower bound for reversible automata
3. Pedro V. Silva, Free group languages: Rational versus recognizable
4. Pierre-Cyrille Héam, A Lower Bound For Reversible Automata