Regular binoid expressions and regular binoid languages.
From MaRDI portal
Recommendations
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- Regular ideal languages and their Boolean combinations
- Axiomatizing the identities of binoid languages
- Boolean Algebras of Regular Languages
- Boolean algebras of regular languages
- A characterization of regular expressions under bisimulation
- scientific article; zbMATH DE number 1502115
- Regular languages and partial commutations
- Regular languages and associative language descriptions
- Duality and the equational theory of regular languages.
Cites work
- scientific article; zbMATH DE number 4044061 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1502105 (Why is no real title available?)
- scientific article; zbMATH DE number 871246 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A survey of two-dimensional automata theory
- Concurrent regular expressions and their relationship to Petri nets
- Free shuffle algebras in language varieties
- Series-parallel languages and the bounded-width property
Cited in
(7)- Algebraic and graph-theoretic properties of infiniten-posets
- Definable transductions and weighted logics for texts
- Axiomatizing the identities of binoid languages
- A note on identities of two-dimensional languages
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- A Kleene theorem for bisemigroup and binoid languages
- Automata on infinite biposets
This page was built for publication: Regular binoid expressions and regular binoid languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401404)
