Information Technology Reference
In-Depth Information
35. McNaughton, R.: Testing and generating infinite sequences by a finite automaton.
Information and Control 9, 521-530 (1966)
36. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees.
Trans. Amer.Math.Soc. 141, 1-35 (1969)
37. Sakarovich, J.: Elements of Automata Theory. Cambridge University Press, Cam-
bridge (2009)
38. Schutzenberger, M.P.: On finite monoids having only trivial subgroups. Informa-
tion and Control 8(2), 190-194 (1965)
39. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. In:
Moore, E.F. (ed.) Sequential Machines: Selected Papers. Addison-Wesley (1964)
40. Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity.
Birkhauser, Boston, Basel and Berlin (1994)
41. Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G.
(eds.) Handbook of Formal Languages. Beyond Words, vol. 3. Springer, Berlin
(1997)
42. Trakhtenbrot, B.A.: Finite automata and logic of monadic predicates. Dokl. Akad.
Nauk SSSR 140, 326-329 (1961) (in Russian)
43. Turing, A.M.: On computable numbers, with an application to the entschei-
dungsproblem. Procedings of the London Mathematical Society 42(2), 230-265
(1936)
44. Vardi, M.Y., Wilke, T.: Automata: from logics to algorithms. In: Logic and Au-
tomata: History and Perspectives (in Honor of Wolfgang Thomas), pp. 629-736
(2008)
Search WWH ::




Custom Search