The equivalence problem for finite substitutions in a regular language

MaRDI QIDQ1840955zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 21 February 2001

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

regular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2086673
• Undecidability of the equivalence of finite substitutions on regular language
• The Equivalence Problem of Finite Substitutions on ab*c, with Applications
• Publication:4941151
• scientific article; zbMATH DE number 1091113

Cited in

(9)

• A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
• Finite transducers and rational transductions
• The undecidability of some equivalence problems concerning ngsm's and finite substitutions
• scientific article; zbMATH DE number 2242596 (Why is no real title available?)
• Language equations
• Solvability problems for \(ND\)-systems
• A Burnside approach to the finite substitution problem
• The magic number problem for subregular language families
• scientific article; zbMATH DE number 1408337 (Why is no real title available?)

This page was built for publication: The equivalence problem for finite substitutions in a regular language

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