Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Regular languages are divided into equivalence classes according to the lengths of the words and both the universal and the existential equivalence of rational transductions on the set of these classes is studied. It is shown that the cardinality equivalence problem is undecidable for e-free finite substitutions. The morphic replication equivalence problem is arithmetized and an application to word equations is presented. Finally, the generalized Post correspondence problem is modified by using a single inverse morphism or a single finite substitution or its inverse instead of two morphisms.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
209--221
Opis fizyczny
bibliogr. 18 poz.
Twórcy
autor
- Department of Mathematical Sciences, University of Oulu, PO Box 3000 Oulu, 90401 Finland, Paavo.Turakainen@oulu.fi
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0007-0041