Characterizing regular languages with polynomial densities
From MaRDI portal
Recommendations
Cites work
- A homomorphic characterization of regular languages
- Can the catenation of two weakly sparse languages be dense?
- Finite counting automata
- scientific article; zbMATH DE number 3902039 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3623560 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- On Isomorphisms and Density of NP and Other Complete Sets
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
Cited in
(36)- Language-theoretic complexity of disjunctive sequences
- On lengths of words in context-free languages
- On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\)
- Structural properties of NFAs and growth rates of nondeterminism measures
- A refinement of Christol's theorem for algebraic power series
- Automata and finite order elements in the Nottingham group
- Synchronized sequences
- \(F\)-sets and finite automata
- On the expressiveness of Büchi arithmetic
- Boolean algebras of regular languages
- Decidability of trajectory-based equations
- The Gelfand-Kirillov dimension of Hecke-Kiselman algebras
- scientific article; zbMATH DE number 1824155 (Why is no real title available?)
- Automata theory on sliding windows
- Deterministic Caterpillar Expressions
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- When is an automatic set an additive basis?
- scientific article; zbMATH DE number 1860666 (Why is no real title available?)
- scientific article; zbMATH DE number 7439745 (Why is no real title available?)
- Automatic sequences and generalised polynomials
- On the density of regular languages
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- scientific article; zbMATH DE number 7770053 (Why is no real title available?)
- Regular languages as images of local functions over small alphabets
- A word reconstruction problem for polynomial regular languages
- Simple classes of automatic structures
- Quasi-isometric reductions between infinite strings
- A characterization of algebraic multivariate power series with sparse support
- A graph-theoretic proof of Cobham's dichotomy for automatic sequences
- Existential definability of unary predicates in Büchi arithmetic
- Deciding regularity of hairpin completions of regular languages in polynomial time
- Representing real numbers in a generalized numeration system
- The growth function of S-recognizable sets
- Weighing obese timed languages
- On the joint subword complexity of automatic sequences
- Deciding determinism of caterpillar expressions
This page was built for publication: Characterizing regular languages with polynomial densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096862)
