Regular binoid expressions and regular binoid languages.
type: Item
instance of: scholarly article
title: Regular binoid expressions and regular binoid languages.
zbMATH Open document ID: 1045.68081
DOI: 10.1016/S0304-3975(03)00137-3
author: Kosaburo Hashiguchi
author: Yoshito Wada
author: Shuji Jimbo
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1965401
zbMATH Keywords: Regular languages
zbMATH Keywords: Binoids
zbMATH Keywords: Regular binoid expressions
zbMATH Keywords: Right linear grammars
MaRDI profile type: Publication
cites work: Free shuffle algebras in language varieties
cites work: Concurrent regular expressions and their relationship to Petri nets
cites work: Q4198075
cites work: Q4503146
cites work: Q4874660
cites work: Q5592246
cites work: A survey of two-dimensional automata theory
cites work: Series-parallel languages and the bounded-width property
cites work: Q3781908
Recommended article: Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Recommended article: Regular Ideal Languages and Their Boolean Combinations
Recommended article: Axiomatizing the identities of binoid languages
Recommended article: Boolean Algebras of Regular Languages
Recommended article: Boolean algebras of regular languages
Recommended article: A characterization of regular expressions under bisimulation
Recommended article: Q4503156
Recommended article: Regular languages and partial commutations
Recommended article: Q5387718
Recommended article: Duality and the equational theory of regular languages.
description: scientific article; zbMATH DE number 1965401