The strong equivalence of ET0L grammars

DOI10.1016/S0020-0190(97)00067-7zbMATH Open1337.68148MaRDI QIDQ287052FDOQ287052

Authors: Gabriel Istrate 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

formal languagesL-systemsstructural equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Defining families of trees with E0L grammars
• Bracketed context-free languages
• Structural equivalence of context-free grammars
• Title not available (Why is that?)
• Parenthesis Grammars
• A characterization of parenthesis languages
• Structural equivalence and ET0L grammars
• Decidability of structural equivalence of E0L grammars

Cited In (2)

• Title not available (Why is that?)
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS

This page was built for publication: The strong equivalence of ET0L grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287052)