Bazsites.com Automata Theory

Directory Topics

Automata Theory - Wikipedia article on finite state machines with links to articles about pushdown automata, linear bounded automata and Turing machines.
Automata - Course notes from the University of Kentucky with sections on finite state automata, pushdown automata and linear bounded automata.
Theory of Automata and Formal Languages - Survey of finite state automata, pushdown automata, Turing machines and the languages accepted by these devices.
Finite-State Automata and Regular Languages - Basic definitions and theorems connecting FSA and regular languages.
Linear Bounded Automata - A course note chapter with a definition of LBA and examples.
Finite Automata With External Storage - Article discussing counter automata, pushdown automata and linear bounded automata and the relation between them.
Types of Automata - Intuitive definitions of automata from the more complex Turing machines to the simpler finite state automata.
Turing Machines - A brief survey of finite state automata, pushdown automata, linear bounded automata and Turing machines.
Shallit, Jeffrey O. - University of Waterloo. Algorithmic number theory (primality testing, and factoring), formal languages and automata theory (especially connections with number theory), history of mathematics and computer science, ethical use of computers.
Automata Theory - An essay by David Weir.

Automata theory - In theoretical computer science, automata theory is the study of abstract machines and problems they are able to solve. Automata theory is closely related to formal language theory as the automata are often classified by the class of formal languages they are able to recognize.
Introduction to Automata Theory, Languages, and Computation - Introduction to Automata Theory, Languages, and Computation, also known as the Cinderella Book, is an influential computer science textbook by John Hopcroft and Jeffrey Ullman on formal languages and the theory of computation. The nickname is derived from a girl (putatively Cinderella) on the cover with a Rube Goldberg machine.
Learning Automata - A branch of the theory of Adaptive control is devoted to learning automata surveyed by Narendra and Thathachar which were originally described explicitly as finite state automata.
Krohn-Rhodes theory - In mathematics, Krohn-Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of finite aperiodic semigroups and finite groups.
Seymour Ginsburg - Seymour Ginsburg (1928-2004) was a pioneer of automata theory, formal language theory, and