The following pages link to Bounded Regular Sets (Q5525345):
Displayed 30 items.
- 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)
- 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)
- 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)
- A Characterization of Semilinear Sets (Q5569453) (← links)
- (Q5576262) (← links)
- Operations and language generating devices suggested by the genome evolution (Q5958327) (← links)