Infinite unfair shuffles and associativity

DOI10.1016/J.TCS.2007.03.030zbMATH Open1118.68112OpenAlexW2109919342MaRDI QIDQ2373763FDOQ2373763

Authors: Maurice H. ter Beek, Jetty 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

Recommendations

• scientific article; zbMATH DE number 1086499
• Associativity of Infinite Synchronized Shuffles and Team Automata
• A note on square-free shuffles of words
• Shuffling and unshuffling
• Square-free shuffles of words

zbMATH Keywords

fairnessinfinite wordsassociativityshuffling

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of process algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Free shuffle algebras in language varieties
• Shuffle on trajectories: Syntactic constraints
• Shuffle languages, Petri nets, and context-sensitive grammars
• Software Descriptions with Flow Expressions
• Mappings of languages by two-tape devices
• The power of synchronizing operations on strings
• Alternative semantics for temporal logics
• Adherences of languages
• Trace theory and VLSI design
• Title not available (Why is that?)
• Langages infinitaires et produit de mixage
• Title not available (Why is that?)
• Synchronized shuffles
• Title not available (Why is that?)
• Associative omega-products of traces
• Implementation and Application of Automata

Cited In (3)

• Associativity of Infinite Synchronized Shuffles and Team Automata
• Infinite hierarchy of expressions containing shuffle closure operator
• Title not available (Why is that?)

This page was built for publication: Infinite unfair shuffles and associativity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373763)