Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
type: Item
instance of: scholarly article
title: Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
zbMATH Open document ID: 1143.68438
author: Kosaburo Hashiguchi
author: Naoto Sakakibara
author: Shuji Jimbo
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 2111035
zbMATH Keywords: Regular language
zbMATH Keywords: Free binoid
zbMATH Keywords: Regular binoid expression
zbMATH Keywords: Regular (monoid) expression
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.09.005
OpenAlex ID: W2085767100
cites work: Free shuffle algebras in language varieties
cites work: Concurrent regular expressions and their relationship to Petri nets
cites work: Q3323279
cites work: Q4198075
cites work: Regular languages of star height one
cites work: Q4503146
cites work: Q4465336
cites work: Regular binoid expressions and regular binoid languages.
cites work: Q4874660
cites work: Series-parallel languages and the bounded-width property
DOI: 10.1016/J.TCS.2003.09.005
description: scientific article; zbMATH DE number 2111035