Mappings of languages by two-tape devices
From MaRDI portal
Publication:5336322
DOI10.1145/321281.321294zbMath0128.24401OpenAlexW1993983161MaRDI QIDQ5336322
Seymour Ginsburg, Edwin H. Spanier
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321281.321294
Related Items
Infinite unfair shuffles and associativity, Unshuffling a square is NP-hard, Succinct representation of regular sets using gotos and Boolean variables, The Billaud conjecture for \(|\varSigma| = 4\), and beyond, Shuffled languages -- representation and recognition, Tree shuffle, On the complexity and decidability of some problems involving shuffle, QRT FIFO automata, breadth-first grammars and their relations, Unions of certain bounded deterministic languages, String shuffle: circuits and graphs, Comparing language operations, The Shuffle Product: New Research Directions, Reasoning about strings in databases, Error detection in formal languages, On Shuffling a Word with its Letter-to-Letter Substitution, Synchronized shuffles, Iterators for sequence expressions
