Abstract
We prove that for special Thue systems T either all congruence classes are regular languages or none of them are. If all classes are regular languages, all syntactical congruences defined by the congruence classes modulo T are equal to the congruence defined by T.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
