Axiomatizing the identities of binoid languages

DOI10.1016/j.tcs.2006.11.028zbMath1108.68067OpenAlexW2084235865MaRDI QIDQ870834

Igor Dolinka

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete systems of \(\mathcal B\)-rational identities
• Group axioms for iteration
• A completeness theorem for Kleene algebras and the algebra of regular events
• Monadic second-order definable text languages
• Regular binoid expressions and regular binoid languages.
• Series-parallel languages and the bounded-width property
• A note on identities of two-dimensional languages
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
• Equational axioms for regular sets
• Algebraic and graph-theoretic properties of infiniten-posets
• Regular expressions and context-free grammars for picture languages

This page was built for publication: Axiomatizing the identities of binoid languages