Axiomatizing the identities of binoid languages
type: Item
instance of: scholarly article
title: Axiomatizing the identities of binoid languages
zbMATH Open document ID: 1108.68067
author: Igor Dolinka
published in: Theoretical Computer Science
publication date: 2007-03-15T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5134096
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.11.028
OpenAlex ID: W2084235865
cites work: Equational axioms for regular sets
cites work: Q5639639
cites work: A note on identities of two-dimensional languages
cites work: Free algebras for generalized automata and language theory
cites work: Group axioms for iteration
cites work: Q4654639
cites work: Algebraic and graph-theoretic properties of infiniten-posets
cites work: Q4714446
cites work: Q3922196
cites work: Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
cites work: Regular binoid expressions and regular binoid languages.
cites work: Q4874660
cites work: Monadic second-order definable text languages
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Complete systems of \(\mathcal B\)-rational identities
cites work: Q2754184
cites work: Towards a language theory for infinite N-free pomsets.
cites work: Q4247275
cites work: Series-parallel languages and the bounded-width property
cites work: Rationality in algebras with a series operation
cites work: Regular expressions and context-free grammars for picture languages
cites work: Q5596826
DOI: 10.1016/J.TCS.2006.11.028
description: scientific article; zbMATH DE number 5134096