Langages infinitaires et produit de mixage

DOI10.1016/0304-3975(84)90128-2zbMath0571.68064OpenAlexW1975460338MaRDI QIDQ1061496

Robert de Simone

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90128-2

zbMATH Keywords

synchronizationparallel computingshuffle productinfinitary languagesrational languagesCOSY programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items (10)

Infinite products in monoids ⋮ Infinite unfair shuffles and associativity ⋮ Mixed product and asynchronous automata ⋮ Component composition preserving behavioral contracts based on communication traces ⋮ The Billaud conjecture for \(|\varSigma| = 4\), and beyond ⋮ Derivatives and partial derivatives for regular shuffle expressions ⋮ Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) ⋮ Semicommutations and algebraic languages ⋮ Derivatives for Regular Shuffle Expressions ⋮ Synchronized shuffles

Uses Software

• COSY

Cites Work

• Adherences of languages
• COSY - a system specification language based on paths and processes
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Langages infinitaires et produit de mixage