Equivalence of Functions Represented by Simple Context-Free Grammars with Output

DOI10.1007/11779148_8MaRDI QIDQ3617047zbMATH OpenOpenAlexFDO

Authors Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter

Publication date 26 March 2009

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779148_8

Mathematics Subject Classification ID

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

Recommendations

• Equivalent conversions of ambiguous context-free grammars
• The equivalence of four extensions of context-free grammars
• On the commutative equivalence of context-free languages
• On differentiation functions, structure functions, and related languages of context-free grammars
• Sortal equivalence of bare grammars
• Equivalence of pushdown automata via first-order grammars
• scientific article; zbMATH DE number 3481858
• Equivalence of transducers relative to regular languages
• scientific article; zbMATH DE number 4155910
• Structural equivalence and ET0L grammars

Cited in

(3)

• scientific article; zbMATH DE number 3952033 (Why is no real title available?)
• Implementation and Application of Automata
• Prime normal form and equivalence of simple grammars

This page was built for publication: Equivalence of Functions Represented by Simple Context-Free Grammars with Output

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