Regular prefix codes and right power-bounded languages. (English) Zbl 0364.94094


68Q45 Formal languages and automata
94B99 Theory of error-correcting codes and error-detecting codes
20M35 Semigroups in automata theory, linguistics, etc.
Full Text: DOI EuDML


[1] A. H. Clifford and G. B. Preston,The Algebraic Theory of Semigroups, Math. Surveys Series, Vols. 1 and 2, Amer. Math. Soc., Providence, R.I., 1961 and 1967. · Zbl 0111.03403
[2] M. Nivat,Eléments de la Théorie Générale des Codes, in E.R. Caianiello, ed., Automata Theory, Academic Press, New York, 1966, pp. 278–294.
[3] J. F. Perrot,Contribution à l’Etude des Monoides Syntactiques et de Certains Groupes Associés aux Automate Finis, Thèse Sc. Math. Paris, 1972. · Zbl 0392.20049
[4] H. J. Shyr and G. Thierrin,Left Noncounting Languages, International J. of Computer and Information Sc., Vol. 4, 1975, pp. 95–102. · Zbl 0297.68060
[5] G. Thierrin,Décomposition des Langages Réguliers, R.I.R.O., 3e année, NO R-3, 1969, pp. 45–50.
[6] P. A. S. Veloso,Modular Parallel Decomposition of Finite Automata, Proceedings of the International Symposium on Uniformly Structured Automata and Logic, Tokyo, 1975, pp. 13–19.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.