Pages that link to "Item:Q5096862"
From MaRDI portal
The following pages link to Characterizing regular languages with polynomial densities (Q5096862):
Displayed 25 items.
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Representing real numbers in a generalized numeration system (Q716307) (← links)
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\) (Q1685967) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- A refinement of Christol's theorem for algebraic power series (Q2114140) (← links)
- Automata and finite order elements in the Nottingham group (Q2132478) (← links)
- Synchronized sequences (Q2140455) (← links)
- \(F\)-sets and finite automata (Q2199490) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- Boolean algebras of regular languages (Q2342107) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- The Gelfand-Kirillov dimension of Hecke-Kiselman algebras (Q2689775) (← links)
- (Q3304130) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- When is an automatic set an additive basis? (Q4577830) (← links)
- (Q5015284) (← links)
- Automatic Sequences and Generalised Polynomials (Q5222169) (← links)
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)
- (Q6070605) (← links)