Radix enumeration of rational languages

DOI10.1051/ita/2010003zbMath1186.68243OpenAlexW2125598813MaRDI QIDQ5190076

Jacques Sakarovitch, Pierre-Yves Angrand

Publication date: 12 March 2010

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/44610

zbMATH Keywords

finite automatasequential transducersrational functions of words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (3)

The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages

Cites Work

• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Numeration systems, linear recurrences, and regular sets
• Numeration systems on a regular language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Radix enumeration of rational languages