Undecidability of the equivalence of finite substitutions on regular language
From MaRDI portal
Publication:4265533
DOI10.1051/ita:1999109zbMath0946.68076MaRDI QIDQ4265533
Publication date: 22 September 1999
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222067
68Q45: Formal languages and automata
Related Items
The Equivalence Problem of Finite Substitutions on ab*c, with Applications, A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
Cites Work