Article PDF
Avoid common mistakes on your manuscript.
References
A. H. Clifford andG. B. Preston,The Algebraic Theory of Semigroups, Math. Surveys Series, Vols. 1 and 2, Amer. Math. Soc., Providence, R.I., 1961 and 1967.
S. Ginsburg,The Mathematical Theory of Context-Free Languages McGraw-Hill, New York, 1968.
A. Ginzburg,Algebraic Theory of Automata, Assoc. Comput Mach. Monograph Series, Academic Press, New York, 1968.
R. McNaughton andS. Papert,Counter-free Automata, M.I.T. Press, 1971.
A. R. Meyer, A note on star-free events,J. Assoc. Comput. Mach. 16 (1969), 220–225.
M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.
M. P. Schützenberger, On finite monoids having only trivial subgroups.Information and Control 8 (1965), 190–194.
M. P. Schützenberger, On a family of sets related to McNaughton's L-language, InAutomata Theory, E. R. Caianiello, (Ed.), Academic Press, New York, (1966), pp. 320–324.
M. P. Schützenberger, On synchronizing prefix codes,Information and Control 11 (1967), 396–401.
G. Thierrin, Décomposition des Langages Réguliers, R.I.R.O. 3e annee, N° R-3, (1969), 45–50.
Author information
Authors and Affiliations
Additional information
This research has been supported by Grant A7877 of the National Research Council of Canada.
Rights and permissions
About this article
Cite this article
Shyr, H.J., Thierrin, G. Power-separating regular languages. Math. Systems Theory 8, 90–95 (1974). https://doi.org/10.1007/BF01761710
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01761710