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

DOI10.1007/11779148_8zbMATH Open1227.68037OpenAlexW1569142300MaRDI QIDQ3617047

Wojciech Fraczak, Cédric Bastien, Jurek Czyzowicz, 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

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Structural equivalence and ET0L grammars 👍 👎
• Equivalent conversions of ambiguous context-free grammars 👍 👎
• On the commutative equivalence of context-free languages 👍 👎
• Equivalence of transducers relative to regular languages 👍 👎
• Equivalence of pushdown automata via first-order grammars 👍 👎
• Sortal Equivalence of Bare Grammars 👍 👎
• The equivalence of four extensions of context-free grammars 👍 👎
• On differentiation functions, structure functions, and related languages of context-free 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)