Associativity of Infinite Synchronized Shuffles and Team Automata

DOI10.3233/FI-2009-0051MaRDI QIDQ3633913zbMATH OpenOpenAlexFDO

Authors Maurice H. ter Beek, Jetty Kleijn

Publication date 23 June 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-0051

zbMATH Keywords

fairnesscompositionalityinfinite wordsassociativityteam automatasynchronized shuffling

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Infinite unfair shuffles and associativity
• Synchronized shuffle on backbones
• Synchronized shuffles
• scientific article; zbMATH DE number 1408332
• scientific article; zbMATH DE number 1860697

Cited in

(3)

• Infinite unfair shuffles and associativity
• Synchronized shuffle on backbones
• On shuffling a word with its letter-to-letter substitution

This page was built for publication: Associativity of Infinite Synchronized Shuffles and Team Automata

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