Structural equivalence and ET0L grammars

DOI10.1016/0304-3975(95)00187-5zbMath0871.68119OpenAlexW2005657640MaRDI QIDQ671426

Derick Wood, Kai Salomaa, Sheng Yu

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00187-5

zbMATH Keywords

structural equivalence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

The strong equivalence of ET0L grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of structural equivalence of E0L grammars
• Defining families of trees with E0L grammars
• Computer science today. Recent trends and developments
• Bracketed context-free languages
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Structural equivalence of context-free grammars
• Complexity of some problems concerningL systems
• Complexity of E0L structural equivalence
• One-sided and two-sided context in formal grammars
• Parenthesis Grammars

This page was built for publication: Structural equivalence and ET0L grammars