Pages that link to "Item:Q1613560"
From MaRDI portal
The following pages link to Construction of regular languages and recognizability of polynomials (Q1613560):
Displaying 8 items.
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
- Syntactical and automatic properties of sets of polynomials over finite fields (Q2469487) (← links)
- Polynomial languages with finite antidictionaries (Q3625693) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- Numeration systems on a regular language (Q5929087) (← links)
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)