Axiomatizing the identities of binoid languages
From MaRDI portal
Publication:870834
DOI10.1016/J.TCS.2006.11.028zbMATH Open1108.68067OpenAlexW2084235865MaRDI QIDQ870834FDOQ870834
Publication date: 15 March 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.028
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group axioms for iteration
- Equational axioms for regular sets
- Complete systems of \(\mathcal B\)-rational identities
- A completeness theorem for Kleene algebras and the algebra of regular events
- Series-parallel languages and the bounded-width property
- Rationality in algebras with a series operation
- Towards a language theory for infinite N-free pomsets.
- Regular expressions and context-free grammars for picture languages
- Monadic second-order definable text languages
- Regular binoid expressions and regular binoid languages.
- Free algebras for generalized automata and language theory
- A note on identities of two-dimensional languages
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- Algebraic and graph-theoretic properties of infiniten-posets
Cited In (2)
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)
