Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids

DOI10.1016/j.tcs.2003.09.005zbMath1143.68438OpenAlexW2085767100MaRDI QIDQ1884948

Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.09.005

zbMATH Keywords

Regular languageFree binoidRegular (monoid) expressionRegular binoid expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Axiomatizing the identities of binoid languages ⋮ A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES

Cites Work

• Free shuffle algebras in language varieties
• Concurrent regular expressions and their relationship to Petri nets
• Regular binoid expressions and regular binoid languages.
• Series-parallel languages and the bounded-width property
• Regular languages of star height one
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids