Automata on Terms

  • Dexter C. Kozen
Part of the Undergraduate Texts in Computer Science book series (UTCS)


The theory of finite automata has many interesting and useful generalizations that allow more general types of inputs, such as infinite strings and finite and infinite trees In this lecture and the next we will study one such generalization: finite automata on terms, also known as finite labeled trees. This generalization is quite natural and has a decidedly algebraical ebraic flavor. In particular, we will show that the entire Myhill—Nerode theory developed in Lectures 13 through 16 is really a consequence of basic results in universal algebra, a branch of algebra that deals with general algebraic concepts such as direct product, homomorphism, homomorphic image, and quotient algebra.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1977

Authors and Affiliations

  • Dexter C. Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations