Regular binoid expressions and regular binoid languages.

DOI10.1016/S0304-3975(03)00137-3zbMath1045.68081MaRDI QIDQ1401404

Shuji Jimbo, Kosaburo Hashiguchi, Yoshito Wada

Publication date: 17 August 2003

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

zbMATH Keywords

Regular languagesBinoidsRegular binoid expressionsRight linear grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids ⋮ Definable transductions and weighted logics for texts ⋮ Axiomatizing the identities of binoid languages ⋮ A note on identities of two-dimensional languages ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ 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
• Series-parallel languages and the bounded-width property
• A survey of two-dimensional automata theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular binoid expressions and regular binoid languages.