General Algebras: How They Function as Tree Acceptors and Push-down Automata

  • J. Richard Büchi
  • Dirk Siefkes


To this point we have concentrated our attention on the very simplest information-processing systems, the finite automata with unary transition algebras. Corresponding to these automata, on the linguistic side, we have found the very simplest grammars, the finite-state grammars. We will now extend the theory, and thus obtain a systematic account of tree automata, push-down automata, and the corresponding context free languages, or term languages.


Unary Case Unary Algebra Inductive Assumption Universal Algebra General Algebra 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1989

Authors and Affiliations

  • J. Richard Büchi
    • 1
  • Dirk Siefkes
    • 2
  1. 1.Computer Science DepartmentPurdue UniversityWest LafayetteUSA
  2. 2.Fachbereich InformatikTechnische Universität BerlinBerlinFederal Republic of Germany

Personalised recommendations