Bounded Regular Sets
From MaRDI portal
Publication:5525345
DOI10.2307/2036087zbMath0147.25301OpenAlexW4233623951MaRDI QIDQ5525345
Edwin H. Spanier, Seymour Ginsburg
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2036087
Related Items (53)
Star-free sets of integers ⋮ On equality of multiplicity sets of regular languages ⋮ Single-tape reset machines ⋮ Two techniques in the area of the star problem in trace monoids ⋮ Computational complexity of synchronization under sparse regular constraints ⋮ Hierarchies of one-way multihead automata languages ⋮ Unnamed Item ⋮ Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ When is an automatic set an additive basis? ⋮ Shuffle on trajectories: Syntactic constraints ⋮ On the open problem of Ginsburg concerning semilinear sets and related problems ⋮ Regular languages and partial commutations ⋮ Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Quantitative estimates for the size of an intersection of sparse automatic sets ⋮ A Characterization of Semilinear Sets ⋮ \(F\)-sets and finite automata ⋮ Deciding whether a relation defined in Presburger logic can be defined in weaker logics ⋮ Ideal separation and general theorems for constrained synchronization and their application to small constraint automata ⋮ Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time ⋮ The monoids of the patience sorting algorithm ⋮ Unnamed Item ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Computing the closure of sets of words under partial commutations ⋮ Separating the Words of a Language by Counting Factors ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ Sparse and slender subsets of monoids. ⋮ 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 ⋮ The algebraic theory of Parikh automata ⋮ Operations and language generating devices suggested by the genome evolution ⋮ On the separability of sparse context-free languages and of bounded rational relations ⋮ Finitely distinguishable erasing pattern languages ⋮ Syntactic operators on full semiAFLs ⋮ String and graph grammar characterizations of bounded regular languages ⋮ Three theorems concerning principal AFLs ⋮ Descriptional Complexity of Bounded Regular Languages ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Substitution and bounded languages ⋮ AFL with the semilinear property ⋮ Synchronization languages ⋮ A logic for document spanners ⋮ On the regularity of languages generated by context-free evolutionary grammars ⋮ Decidability of trajectory-based equations ⋮ Support of an algebraic series as the range of a recursive sequence ⋮ Decidability of Right One-Way Jumping Finite Automata ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4 ⋮ Scattered deletion and commutativity ⋮ An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable ⋮ 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
Cites Work
This page was built for publication: Bounded Regular Sets
