Construction of regular languages and recognizability of polynomials

DOI10.1016/S0012-365X(01)00377-6zbMath1002.68086OpenAlexW2127757588MaRDI QIDQ1613560

Michel Rigo

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00377-6

zbMATH Keywords

finite automatalexicographically ordered infinite regular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

On extended boundary sequences of morphic and Sturmian words ⋮ First-Order Logic and Numeration Systems ⋮ The growth function of \(S\)-recognizable sets ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ Decimations of languages and state complexity

This page was built for publication: Construction of regular languages and recognizability of polynomials