Document Zbl 0503.68055

Classifying regular events in symbolic logic. (English) Zbl 0503.68055

J. Comput. Syst. Sci. 25, 360-376 (1982).

Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0503.68055

MSC:

68Q45	Formal languages and automata
03D05	Automata and formal grammars in connection with logical questions

Keywords:

regular languages; dot-depth hierarchy; monadic second-order definability

Cite Review PDF

Full Text: DOI

References:

[1]	Brzozowski, J. A., Hierarchies of aperiodic languages, Rev. franc. automat. informat. recherche opérationelle, 10, 33-49 (1976)
[2]	Brzozowski, J. A.; Knast, R., The Dot-depth hierarchy of star-free languages is infinite, J. Comput. System Sci., 16, 37-55 (1978) · Zbl 0368.68074
[3]	Brzozowski, J. A.; Simon, I., Characterizations of locally testable events, Discrete Math., 4, 243-271 (1973) · Zbl 0255.94032
[4]	Büchi, J. R., Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlagen Math., 6, 66-92 (1960) · Zbl 0103.24705
[5]	Cohen, R. S.; Brzozowsk̇i, J. A., Dot-depth of star-free events, J. Comput. System Sci., 5, 1-16 (1971) · Zbl 0217.29602
[6]	Eggan, L. C., Transition graphs and the star-height of regular events, Michigan Math. J., 10, 385-397 (1963) · Zbl 0173.01504
[7]	Ehrenfeucht, A., An application of games to the completeness problem for formalized theories, Fund. Math., 49, 129-141 (1961) · Zbl 0096.24303
[8]	Eilenberg, S., (Automata, Languages, and Machines, Vol. B (1976), Academic Press: Academic Press New York) · Zbl 0359.94067
[9]	Elgot, C. C., Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc., 98, 21-52 (1961) · Zbl 0111.01102
[10]	Hanf, W., Model-theoretic methods in the study of elementary logic, (Addison, J. W.; etal., The Theory of Models (1965), North-Holland: North-Holland Amsterdam), 132-145 · Zbl 0166.25801
[11]	Hintikka, J., Distributive normal forms in first-order logic, (Crossley, J. N.; Dummett, M. A.E., Formal Systems and Recursive Functions, Proc. Eighth Logic Coll. (1965), North-Holland: North-Holland Amsterdam), 47-90 · Zbl 0207.29002
[12]	Ladner, R. E., Application of model-theoretic games to discrete linear orders and finite automata, Inform. and Control, 33, 281-303 (1977) · Zbl 0387.68037
[13]	McNaughton, R.; Papert, S., Counter-Free Automata, ((1971), MIT Press: MIT Press Cambridge, Mass) · Zbl 0232.94024
[14]	Thomas, W., The theory of successor with an extra predicate, Math. Ann., 237, 121-132 (1978) · Zbl 0369.02025

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.