The strong equivalence of ET0L grammars

DOI10.1016/S0020-0190(97)00067-7MaRDI QIDQ287052zbMATH OpenFDO

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

• {{#invoke:WikidataIB|getLink|Q4036763}} scientific article; zbMATH DE number 176929 (Why is no real title available?)
• {{#invoke:WikidataIB|getLink|Q5592248}} A characterization of parenthesis languages
• {{#invoke:WikidataIB|getLink|Q2525996}} Bracketed context-free languages
• {{#invoke:WikidataIB|getLink|Q807023}} Decidability of structural equivalence of E0L grammars
• {{#invoke:WikidataIB|getLink|Q1179185}} Defining families of trees with E0L grammars
• {{#invoke:WikidataIB|getLink|Q5553283}} Parenthesis Grammars
• {{#invoke:WikidataIB|getLink|Q671426}} Structural equivalence and ET0L grammars
• {{#invoke:WikidataIB|getLink|Q2534284}} Structural equivalence of context-free grammars

Cited in

(2)

• scientific article; zbMATH DE number 2040912 (Why is no real title available?)
• 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)