scientific article; zbMATH DE number 2086673

MaRDI QIDQ4737210zbMATH OpenFDO

Authors Juhani Karhumäki, L. P. Lisovik

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800812.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• Undecidability of the equivalence of finite substitutions on regular language
• The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
• Publication:4941151
• On the equivalence of some transductions involving letter to letter morphisms on regular languages

Cited in

(13)

• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• The equivalence problem for finite substitutions in a regular language
• A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
• A Burnside approach to the finite substitution problem
• scientific article; zbMATH DE number 1688379 (Why is no real title available?)
• scientific article; zbMATH DE number 177835 (Why is no real title available?)
• Undecidability of the equivalence of finite substitutions on regular language
• scientific article; zbMATH DE number 1339972 (Why is no real title available?)
• scientific article; zbMATH DE number 1091113 (Why is no real title available?)
• scientific article; zbMATH DE number 1408337 (Why is no real title available?)
• The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• Finiteness and recognizability problems for substitution maps on two symbols

This page was built for publication:

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