The Collected Works of J. Richard Büchi pp 23-23 | Cite as
J. Richard Büchi’s Doctoral Students
Chapter
Keywords
Turing Machine Closure Space Order Theory Finite Automaton Canonical System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
- William Henry Hosken (1966)—Canonical Systems Which Produce Regular Sets.Google Scholar
- Lawrence Hugh Landweber (1967)—A Design Algorithm for Sequential Machines and Definability in Monadic Second Order Arithmetic.Google Scholar
- Gary Martin Haggard (1968)—Embedding of Graphs in Surfaces.Google Scholar
- Kenneth Joe Danhof (1969)—On Definability and the Cantor Method in Model Theory.Google Scholar
- Peng-Siu Mei (1971)—Linear Closure Spaces and Matroids, Convex Closure Spaces and Paramatroids.Google Scholar
- Jean-Louis Lassez (1973)—On the Relationship between Prefix Codes, Trees and Automata.Google Scholar
- Charles Zaiontz (1974)—Automata and the Monadic Theory of Ordinals < ω2.Google Scholar
- Terrence Michael Owens (1975)—Varieties of Skolem Rings.Google Scholar
- William Ellis Fenton (1982)—Axiomatic Convexity Theory.Google Scholar
- Steven Orville Senger (1982)—The Existential Theory of Concatenation over a Finite AlphabetGoogle Scholar
Copyright information
© Springer-Verlag New York Inc. 1990