Handbook of formal languages, vol. 1
Undecidability in integer weighted finite automata
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Acta Informatica
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Sequential grammars and automata with valances
Theoretical Computer Science
Languages Accepted by Integer Weighted Finite Automata
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Context-Free Valence Grammars - Revisited
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
An Undecidability Result Concerning Periodic Morphisms
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Hi-index | 0.00 |
We consider the generalized equality set, i.e., the set of solutions of the generalized Post Correspondence Problem. Actually we study the solutions of a special instances where one of the morphisms is periodic and the begin word is a letter. We considering the languages defined by mapping the equality set by a coding, and prove that the family achieved is exactly family of regular valence languages over Z.