Defining families of trees with E0L grammars

DOI10.1016/0166-218X(91)90100-BzbMath0746.68054MaRDI QIDQ1179185

Thomas Ottmann, Derick Wood

Publication date: 26 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

EOL grammarsdefining of treesgenerating of trees

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

The strong equivalence of ET0L grammars ⋮ Complexity of EOL structural equivalence ⋮ Complexity of E0L structural equivalence ⋮ Structural equivalence and ET0L grammars ⋮ Decidability of structural equivalence of E0L grammars ⋮ Decidability of EDT0L structural equivalence

Cites Work

• On equality of multiplicity sets of regular languages
• (g//0,g//1,\dots ,g//k)-trees and unary OL systems
• Implementing dictionaries using binary trees of very small height
• A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
• Parenthesis Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Defining families of trees with E0L grammars