Infinite unfair shuffles and associativity
From MaRDI portal
Publication:2373763
DOI10.1016/j.tcs.2007.03.030zbMath1118.68112MaRDI QIDQ2373763
Maurice H. ter Beek, H. C. M. Kleijn
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.030
68R15: Combinatorics on words
Cites Work
- Free shuffle algebras in language varieties
- Langages infinitaires et produit de mixage
- Shuffle on trajectories: Syntactic constraints
- Adherences of languages
- The power of synchronizing operations on strings
- Trace theory and VLSI design
- Alternative semantics for temporal logics
- Synchronized shuffles
- Shuffle languages, Petri nets, and context-sensitive grammars
- Software Descriptions with Flow Expressions
- Mappings of languages by two-tape devices
- Implementation and Application of Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item