Shuffle binoids
From MaRDI portal
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- An Eilenberg theorem for -languages
- Axiomatizing shuffle and concatenation in languages
- Complete systems of \(\mathcal B\)-rational identities
- Free shuffle algebras in language varieties
- Group axioms for iteration
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 1231455 (Why is no real title available?)
- scientific article; zbMATH DE number 1047921 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 194946 (Why is no real title available?)
- Languages under concatenation and shuffling
- Modeling concurrency with partial orders
- Nonfinite axiomatizability of shuffle inequalities
- Nonfinite axiomatizability of the equational theory of shuffle
- The equational theory of pomsets
- The Recognition of Series Parallel Digraphs
- Une condition impliquant toutes les identités rationnelles
- Une remarque sur les systèmes complets d'identités rationnelles
- Varieties of ordered algebras
This page was built for publication: Shuffle binoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446131)