General Algebras: How They Function as Tree Acceptors and Push-down Automata
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.
KeywordsUnary Case Unary Algebra Inductive Assumption Universal Algebra General Algebra
Unable to display preview. Download preview PDF.