Equivalence of simple functions

DOI10.1016/j.tcs.2007.01.011zbMath1111.68051OpenAlexW2076501806MaRDI QIDQ880171

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

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.011

zbMATH Keywords

context-free grammarformal languageequivalence problemsimple grammarpush-down transducersimple function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the decidability of equivalence for deterministic pushdown transducers
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• A fast algorithm to decide on the equivalence of stateless DPDA
• Implementation and Application of Automata
• Implementation and Application of Automata