Left-noncounting languages. (English) Zbl 0297.68060


68Q45 Formal languages and automata
Full Text: DOI


[1] J. A. Brzozowski, K. ?ulik II, and A. Gabrielian, ?Classification of noncounting events,?J. Comp. Syst. Sci.,5(1):41?53 (1971). · Zbl 0241.94050
[2] A. H. Clifford and G. B. Preston, ?The algebraic theory of semigroups,?Math. Surveys 7, Vol. 1 (Amer. Math. Soc., Providence, Rhode Island, 1961). · Zbl 0111.03403
[3] R. McNaughton and S. Papert,Counter-Free Automata (MIT Press, 1971).
[4] M. Nivat, ?Éléments de la théorie générate des codes,? in E. R. Caianiello, ed.,Automata Theory (Academic Press, New York, 1966), pp. 278?294.
[5] M. O. Rabin and D. Scott, ?Finite Automata and their decision problems,?IBM J. Res. Develop. 3(2):114?125 (1959). · Zbl 0158.25404
[6] M. P. Schützenberger, ?On synchronizing prefix codes,?Inf. Control 11:396?401 (1967). · Zbl 0157.25905
[7] H. J. Shyr and G. Thierrin, ?Power-separating regular languages,?Mathematical System Theory 8(1):90?95 (1974). · Zbl 0287.68045
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.