Bounded Regular Sets
From MaRDI portal
Publication:5525345
DOI10.2307/2036087zbMath0147.25301MaRDI QIDQ5525345
Edwin H. Spanier, Seymour Ginsburg
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2036087
Related Items
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, Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable, Unboundedness Problems for Languages of Vector Addition Systems., Separating the Words of a Language by Counting Factors, Unnamed Item, A Characterization of Semilinear Sets, Operations and language generating devices suggested by the genome evolution, Decidability of Right One-Way Jumping Finite Automata, On the open problem of Ginsburg concerning semilinear sets and related problems, Regular languages and partial commutations, The algebraic theory of Parikh automata, Syntactic operators on full semiAFLs, On the separability of sparse context-free languages and of bounded rational relations, 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, 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, Unnamed Item, String and graph grammar characterizations of bounded regular languages
Cites Work
