Axiomatizing the identities of binoid languages
From MaRDI portal
Recommendations
- Axiomatizing the equational theory of regular tree languages
- The multiplicative fragment of the Yanov equational theory
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- Regular binoid expressions and regular binoid languages.
- Infinitary axiomatization of the equational theory of context-free languages
Cites work
- scientific article; zbMATH DE number 1670860 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 1302032 (Why is no real title available?)
- scientific article; zbMATH DE number 2143010 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 871246 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- A note on identities of two-dimensional languages
- Algebraic and graph-theoretic properties of infiniten-posets
- Complete systems of \(\mathcal B\)-rational identities
- Equational axioms for regular sets
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- Free algebras for generalized automata and language theory
- Group axioms for iteration
- Monadic second-order definable text languages
- Rationality in algebras with a series operation
- Regular binoid expressions and regular binoid languages.
- Regular expressions and context-free grammars for picture languages
- Series-parallel languages and the bounded-width property
- Towards a language theory for infinite N-free pomsets.
Cited in
(7)- The multiplicative fragment of the Yanov equational theory
- Regular binoid expressions and regular 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
- Infinitary axiomatization of the equational theory of context-free languages
- Infinitary axiomatization of the equational theory of context-free languages
This page was built for publication: Axiomatizing the identities of binoid languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870834)
