The equivalence problem for finite substitutions in a regular language
From MaRDI portal
Publication:1840955
zbMath0961.68531MaRDI QIDQ1840955
Publication date: 21 February 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Related Items (3)
A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) ⋮ Finite transducers and rational transductions ⋮ Language equations
This page was built for publication: The equivalence problem for finite substitutions in a regular language
