The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

DOI10.1007/978-3-540-74240-1_32zbMath1135.68457OpenAlexW1507487447MaRDI QIDQ5444976

Michal Kunc

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

Unique decipherability in the monoid of languages: an application of rational relations ⋮ Unique Decipherability in the Monoid of Languages: An Application of Rational Relations ⋮ Finite transducers and rational transductions ⋮ Language equations

This page was built for publication: The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable