×

zbMATH — the first resource for mathematics

\(\omega\)-computations on Turing machines. (English) Zbl 0368.68057

MSC:
68Q45 Formal languages and automata
03D10 Turing machines and related notions
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Buchi, J.R., On a decision method in restricted second order arithmetic, Int. congr. logic methodology and philosophy of science, (1960), Stanford, CA · Zbl 0142.24902
[2] Choueka, Y., Theories of automata on ω-tapes: A simplified approach, J. comput. systems sci., 8, 117-141, (1974) · Zbl 0292.02033
[3] Cohen, R.S.; Gold, A.Y., Theory of ω-languages; part I: characterizations of ω-context free languages, J. comput. systems sci., 15, 169-184, (1977) · Zbl 0363.68113
[4] Cohen, R.S.; Gold, A.Y., Theory of ω-languages; part II: A study of various models of ω-type generation and recognition, J. comput. systems sci., 15, 185-208, (1977) · Zbl 0363.68114
[5] Cohen, R.S.; Gold, A.Y., Ω-computations on deterministic pushdown machines, Tr 56, (1975), Computer Science Dept., Technion-IIT Haifa, J. Comput. Systems Sci. (to appear) · Zbl 0382.03025
[6] Cohen, R.S.; Gold, A.Y., On the limitations of ω-type Turing acceptors, Tr 89, (1976), Computer Science Dept., Technion-IIT Haifa
[7] Eilenberg, S., Automata, languages and machines, Vol. A, (1974), Academic Press New York · Zbl 0317.94045
[8] Hartmanis, J.; Stearns, R.E., On the computational complexity of algorithms, Trans. am. math. soc., 117, 285-306, (1965) · Zbl 0131.15404
[9] Hopcroft, E.J.; Ullman, J.D., Formal languages and their relation to automata, (1969), Addison-Wesley Reading, MA · Zbl 0196.01701
[10] Hosseley, R., Finite tree automata and ω-automata, Tr mac-102, (1972), MIT Cambridge, MA
[11] Landweber, L.H., Decision problems for ω-automata, Math. systems theory, 3, 376-384, (1969) · Zbl 0182.02402
[12] Linna, M., On ω-sets associated with context-free languages, Information and control, 31, 272-293, (1976) · Zbl 0329.68066
[13] McNaughton, R., Testing and generating infinite sequences by a finite automaton, Information and control, 9, 521-530, (1966) · Zbl 0212.33902
[14] Rabin, M.O., Decidability of second-order theories and automata on infinite trees, Trans. am. math. soc., 141, 1-35, (1969) · Zbl 0221.02031
[15] Shannon, C.E., A universal Turing machine with two internal slates, Automata studies(annals of math. studies 34), (1956), Princeton, NJ
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.