Pages that link to "Item:Q5336322"
From MaRDI portal
The following pages link to Mappings of languages by two-tape devices (Q5336322):
Displaying 17 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Tree shuffle (Q389936) (← links)
- Iterators for sequence expressions (Q794178) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond (Q2164000) (← links)
- Infinite unfair shuffles and associativity (Q2373763) (← links)
- Error detection in formal languages (Q2547123) (← links)
- Synchronized shuffles (Q2566012) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- Unions of certain bounded deterministic languages (Q3339315) (← links)
- Comparing language operations (Q4146261) (← links)
- On Shuffling a Word with its Letter-to-Letter Substitution (Q4988960) (← links)
