On the generating sequences of regular languages on k symbols

DOI10.1145/950620.950625zbMath1325.68125OpenAlexW1994038249MaRDI QIDQ3452513

Dominique Perrin, Marie-Pierre Béal

Publication date: 12 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/950620.950625

zbMATH Keywords

regular languagesregular sequencesrational sequencesgenerating sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

On counting functions and slenderness of languages ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ On bounded linear codes and the commutative equivalence ⋮ On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata

This page was built for publication: On the generating sequences of regular languages on k symbols