Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Some classifications of Indian parallel languages
Journal of Information Processing and Cybernetics
Decidability of structural equivalence of EOL grammars
Theoretical Computer Science
Defining families of trees with E0L grammars
Discrete Applied Mathematics - Formal language theory
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
Theory of Computation: A Primer
Theory of Computation: A Primer
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Structural Equivalences and ET0L Grammars (Extended Abstract)
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
| Hi-index | 5.23 |
We show that a tree pushdown automaton can verify, for an arbitrary nondeterministically constructed structure tree t, that t does not correspond to any valid derivation of a given EDT0L grammar. In this way we reduce the structural equivalence problem for EDT0L grammars to deciding emptiness of the tree language recognized by a tree pushdown automaton, i.e., to the emptiness problem for context-free tree languages. Thus we establish that structural equivalence for EDT0L grammars can be decided effectively. The result contrasts the known undecidability result for ET0L structural equivalence.