Valence languages generated by equality sets

Authors:
Vesa Halava;Tero Harju;Hendrik Jan Hoogeboom;Michel Latteux
Affiliations:
Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, Turku, Finland;Department of Mathematics and TUCS - Turku Centre for Computer Science, University of Turku, Turku, Finland;Department of Computer Science, Leiden University, RA Leiden, The Netherlands;Université des Sciences et Technologies de Lille, Villeneuve d'Ascq Cédex, France
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2004

Citing 8
Cited 0

Morphisms

Handbook of formal languages, vol. 1
Undecidability in integer weighted finite automata

Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Fair sticker languages

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.