Equivalence of simple functions

DOI10.1016/J.TCS.2007.01.011zbMATH Open1111.68051OpenAlexW2076501806MaRDI QIDQ880171FDOQ880171

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

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

Recommendations

• scientific article; zbMATH DE number 2096518
• scientific article; zbMATH DE number 1482186
• Equal Integrals of Functions
• Equivalence of analytic and rational functions
• Equivalence of Families of Functions on the Natural Numbers
• Similar functions and their properties
• On similarity of functions
• scientific article; zbMATH DE number 94249
• scientific article; zbMATH DE number 1372728

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• Implementation and Application of Automata
• On the decidability of equivalence for deterministic pushdown transducers
• Title not available (Why is that?)
• A fast algorithm to decide on the equivalence of stateless DPDA
• Implementation and Application of Automata

Cited In (3)

• Not all multi-valued partial CFL functions are refined by single-valued functions (extended abstract)
• Simple collective identity functions
• Implementation and Application of Automata

This page was built for publication: Equivalence of simple functions

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