scientific article; zbMATH DE number 3569849

MaRDI QIDQ4140399zbMATH OpenFDO

Authors Takayuki Kimura

Publication date 1976

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(16)

• Langages infinitaires et produit de mixage
• Extending regular expressions with iterated shuffle
• The equational theory of pomsets
• Observations on the complexity of regular expression problems
• The power of synchronizing operations on strings
• \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
• The commutative closure of shuffle languages over group languages is regular
• Infinite unfair shuffles and associativity
• Synchronized shuffles
• On recognising words that are squares for the shuffle product
• The Shuffle Product: New Research Directions
• There is no complete axiom system for shuffle expressions
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
• scientific article; zbMATH DE number 7376042 (Why is no real title available?)
• The n-ary initial literal and literal shuffle
• On the complexity of iterated shuffle

This page was built for publication:

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