Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 1994

Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems

Abstract

We define different types of bottom-up tree pushdown automata and study their connections with rewrite systems. Along this line of research we complete and generalize the results of Gallier, Book and Salomaa. We define the notion of a tail-reduction-free (trf) rewrite system. Using the decidability of ground reducibility, we prove the decidability of the trf property. Monadic rewrite systems of Book, Gallier and Salomaa become a natural particular case of trf rewrite systems. We associate a deterministic bottom-up tree pushdown automaton with any left-linear trf rewrite system. Finally, we generalize monadic rewrite systems by introducing the notion of a semi-monadic rewrite system and show that, like a monadic rewrite system, it preserves recognizability.
No file

Dates and versions

inria-00538881 , version 1 (23-11-2010)

Identifiers

  • HAL Id : inria-00538881 , version 1

Cite

Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sandor Vágvölgyi. Bottom-up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theoretical Computer Science, 1994, 127 (1), pp.69--98. ⟨inria-00538881⟩
93 View
0 Download

Share

Gmail Facebook X LinkedIn More