Representation theorems on regular languages. (English) Zbl 0516.68063


68Q45 Formal languages and automata
Full Text: DOI


[1] Linna, M., Finite power property of regular languages, (), 87-98
[2] Linna, M., The FPP-problem for regular languages, Bull. EATCS, 22-27, (1978)
[3] Simon, I., Limited subsets of a free monoid, (), 143-150
[4] Hashiguchi, A decision procedure for the order of regular events, Theoret. comput. sci., 8, 69-72, (1979) · Zbl 0419.68088
[5] McNaughton, R.; Papert, S., Counter-free automata, (1971), MIT Press Cambridge, Mass · Zbl 0232.94024
[6] Eggan, L.C., Transition graphs and the star height of regular events, Michigan math. J., 10, 385-397, (1963) · Zbl 0173.01504
[7] M. {\scOyamaguchi}, personal communication.
[8] Hashiguchi, K., Limitedness theorem on finite automata with distance functions, J. comput. system sci., 24, 233-244, (1982) · Zbl 0513.68051
[9] Hashiguchi, K.; Honda, N., The star height of reset-free events and strictly locally testable events, Inform. control., 40, 267-284, (1979) · Zbl 0406.68051
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.