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

J. Richard Büchi and Dirk Siefkes
Additional contact information
J. Richard Büchi: Purdue University, Computer Science Department
Dirk Siefkes: Technische Universität Berlin, Fachbereich Informatik

Chapter Chapter 6 in Finite Automata, Their Algebras and Grammars, 1989, pp 217-270 from Springer

Abstract: Abstract 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.

Keywords: Unary Case; Unary Algebra; Inductive Assumption; Universal Algebra; General Algebra (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8853-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461388531

DOI: 10.1007/978-1-4613-8853-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().