×

Properties of code events and homomorphisms over regular events. (English) Zbl 0355.94065


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] McNaughton, R.; Papert, S., (Counter-Free Automat (1971), MIT Press: MIT Press Cambridge, Mass.) · Zbl 0232.94024
[2] Zalcstein, Y., Locally testable languages, J. Comput. System Sci., 6, 151-167 (1972) · Zbl 0242.68038
[3] Schützenberger, M. P., On finite monoids having only trivial subgroups, Inform. Contr., 8, 190-194 (1965) · Zbl 0131.02001
[4] Brzozowski, J. A., Derivatives of regular expressions, J. Assoc. Comput. Mach., 11, 481-494 (1964) · Zbl 0225.94044
[5] Brzozowski, J. A., Roots of star events, J. Assoc. Comput. Mach., 14, 466-477 (1967) · Zbl 0162.02601
[6] Schützenberger, M. P., On an application of some semigroup methods to some problems in coding, IEEE Trans. Information Theory, 2, 47-60 (1956)
[7] Blum, E. K., Free subsemigroups of a free semigroup, Michigan Math. J., 12, 179-182 (1965) · Zbl 0134.02302
[8] Blum, E. K., A note on free subsemigroups with two generators, Bull. Amer. Math. Soc., 71, 678-679 (1965) · Zbl 0131.02004
[9] Brzozowski, J. A.; Simon, I., Characterizations of locally testable events, Discrete Math., 4, 243-271 (1973) · Zbl 0255.94032
[10] McNaughton, R., Algebraic decision procedures for local testability, Math. Systems Theory, 8, 60-76 (1974) · Zbl 0287.02022
[11] Restivo, A., On a question of McNaughton and Papert, Inform. Contr., 25, 93-101 (1974) · Zbl 0279.68054
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.