The following pages link to Bounded Regular Sets (Q5525345):
Displayed 50 items.
- On the open problem of Ginsburg concerning semilinear sets and related problems (Q391304) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831) (← links)
- Star-free sets of integers (Q1079381) (← links)
- On equality of multiplicity sets of regular languages (Q1087336) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- The decidability of a mapping problem for generalized sequential machines with final states (Q1216390) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- Proving containment of bounded AFL (Q1230665) (← links)
- Synchronization languages (Q1285575) (← links)
- On the regularity of languages generated by context-free evolutionary grammars (Q1304479) (← links)
- Scattered deletion and commutativity (Q1318700) (← links)
- The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Support of an algebraic series as the range of a recursive sequence (Q2097086) (← links)
- A refinement of Christol's theorem for algebraic power series (Q2114140) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- \(F\)-sets and finite automata (Q2199490) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- A logic for document spanners (Q2322723) (← links)
- Sparse and slender subsets of monoids. (Q2480765) (← links)
- Three theorems concerning principal AFLs (Q2546302) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- Deciding whether a relation defined in Presburger logic can be defined in weaker logics (Q3514638) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Single-tape reset machines (Q3709914) (← links)
- (Q4147595) (← links)
- String and graph grammar characterizations of bounded regular languages (Q4194489) (← links)
- When is an automatic set an additive basis? (Q4577830) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
- Computing the closure of sets of words under partial commutations (Q4645168) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- A Characterization of Semilinear Sets (Q5569453) (← links)
- (Q5576262) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)