• Corpus ID: 29292217

Tree Automata

  title={Tree Automata},
  author={Ferenc G{\'e}cseg and Magnus Steinby},
Exercise 14 (yield(Rec) and CF) 1. Give a context-free grammar over the terminal alphabet {(a ,) a , (b ,) b } generating the Dyck language of well-bracketed strings. 3. Give a regular tree grammar G in normal form such that for some e, the language yield e (L(G)) is the language from 1. 4. Using the construction from the lecture, transform the regular tree grammar G from 2. into a context-free grammar G such that L(G) = yield γ (L(G)). Is there a simpler context-free grammar generating the… 

Context-Free NCE Graph Grammars

This paper shows some close relationships between context-free graph grammars and concepts from string language theory and tree language theory, and shows how the generated graph languages can be described in terms of regular tree languages and regular string languages.

Context-Free Grammars with Storage

The context-free S languages can be obtained from the deterministic one-way S automaton languages by way of the delta operations on languages, introduced in this paper.

Derivational minimalism in two regular and logical steps

The trees of the resulting regular tree language are unpacked int o the intended “linguistic” trees with an MSO transduction based upon tree-walking automata to give an operational as well as a logical description of the tree sets involved.

Pushdown Machines for the Macro Tree Transducer

Spinal-Formed Context-Free Tree Grammars

It is shown that the class of string languages generated by spine Grammars coincides with that of tree adjoining grammars.

On Müller context-free grammars

Fuzzy Deterministic Top-down Tree Automata

It is proved that the path closure of any regular L-fuzzy tree language is DT-recognizable, and that it is decidable whether a regular L/subfamily of that language isDT- Recognizable.

The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable

This paper shows that these three problems are decidable for finitely ambiguous max-plus tree automata, which aremax-plus automata that operate on trees instead of words that are strictly more expressive than deterministic max- plus automata.



Translations on a Context-Free Grammar

Context-free grammars on trees

This paper defines the tree analogue of a non deterministic generalized sequential machine and obtain results about the domain and range of such a mapping and relates these results to the theory of generalized finite automata6.

Formal languages and their relation to automata

  • J. HopcroftJ. Ullman
  • Computer Science
    Addison-Wesley series in computer science and information processing
  • 1969
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory.

Pushdown Machines for the Macro Tree Transducer

Languages in general algebras

It is shown (Theorem 2.1.3) that phrase structure (PS) languages are the same as the CF languages in any (finitely generated) generic algebra, and the notion of algebraic transduction generalizes the idea of binary transduction as presented for generic monadic algebras by Elgot and Mezei (EM).

Compositions of n tree transducers

It is shown that transductions need not preserve surface sets and exhibits a hierarchy of tree languages obtained by successive transduction, as well as a list of first-order axioms for plane (ordered) trees.

Tree Acceptors and Some of Their Applications

  • J. Doner
  • Mathematics, Computer Science
    J. Comput. Syst. Sci.
  • 1970

The Minimalization of Tree Automata

Context-dependent Tree Automata