Bounded Regular Sets
From MaRDI portal
Cites work
Cited in
(61)- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Star-free sets of integers
- On equality of multiplicity sets of regular languages
- Hierarchies of one-way multihead automata languages
- Shuffle on trajectories: Syntactic constraints
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- The decidability of a mapping problem for generalized sequential machines with final states
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Proving containment of bounded AFL
- Synchronization languages
- On the regularity of languages generated by context-free evolutionary grammars
- Scattered deletion and commutativity
- The star problem and the finite power property in trace monoids: Reductions beyond C4
- Two techniques in the area of the star problem in trace monoids
- Support of an algebraic series as the range of a recursive sequence
- A refinement of Christol's theorem for algebraic power series
- Regularity conditions for iterated shuffle on commutative regular languages
- The commutative closure of shuffle languages over group languages is regular
- Computational complexity of synchronization under sparse regular constraints
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
- \(F\)-sets and finite automata
- Finitely distinguishable erasing pattern languages
- A logic for document spanners
- Sparse and slender subsets of monoids.
- Three theorems concerning principal AFLs
- Substitution and bounded languages
- AFL with the semilinear property
- Decidability of trajectory-based equations
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
- Descriptional complexity of bounded regular languages
- Deciding whether a relation defined in Presburger logic can be defined in weaker logics
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
- How to Tackle Integer Weighted Automata Positivity
- Single-tape reset machines
- On the open problem of Ginsburg concerning semilinear sets and related problems
- Regular languages and partial commutations
- scientific article; zbMATH DE number 3578341 (Why is no real title available?)
- String and graph grammar characterizations of bounded regular languages
- When is an automatic set an additive basis?
- The monoids of the patience sorting algorithm
- Computing the closure of sets of words under partial commutations
- Unboundedness problems for languages of vector addition systems
- Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
- Separating the words of a language by counting factors
- A Characterization of Semilinear Sets
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- Decidability of right one-way jumping finite automata
- Operations and language generating devices suggested by the genome evolution
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- Quantitative estimates for the size of an intersection of sparse automatic sets
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- A word reconstruction problem for polynomial regular languages
- Rational subsets of Baumslag-Solitar groups
- Automata for the commutative closure of regular languages
- An efficient quantifier elimination procedure for Presburger arithmetic
- A characterization of algebraic multivariate power series with sparse support
- The algebraic theory of Parikh automata
- The complexity of separability for semilinear sets and Parikh automata
- Syntactic operators on full semiAFLs
- On the separability of sparse context-free languages and of bounded rational relations
This page was built for publication: Bounded Regular Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525345)
