Pages that link to "Item:Q2372782"
From MaRDI portal
The following pages link to On the complexity of infinite words generated by countable \(q\)-automata (Q2372782):
Displaying 10 items.
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- On complexity functions of infinite words associated with generalized Dyck languages (Q954986) (← links)
- Avoiding squares and overlaps over the natural numbers (Q1045019) (← links)
- Morphisms on infinite alphabets, countable states automata and regular sequences (Q1674337) (← links)
- Quantum \(\omega\)-automata over infinite words and their relationships (Q1741054) (← links)
- Substitution dynamical systems on infinite alphabets (Q2372778) (← links)
- Arithmetics properties of substitutions and infinite automata (Q2372784) (← links)
- Drunken man infinite words complexity (Q3526419) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703760) (← links)