Regular binoid expressions and regular binoid languages.
From MaRDI portal
Publication:1401404
DOI10.1016/S0304-3975(03)00137-3zbMATH Open1045.68081MaRDI QIDQ1401404FDOQ1401404
Authors: Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- Regular ideal languages and their Boolean combinations
- Axiomatizing the identities of binoid languages
- Boolean Algebras of Regular Languages
- Boolean algebras of regular languages
- A characterization of regular expressions under bisimulation
- scientific article; zbMATH DE number 1502115
- Regular languages and partial commutations
- Regular languages and associative language descriptions
- Duality and the equational theory of regular languages.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Series-parallel languages and the bounded-width property
- Free shuffle algebras in language varieties
- Title not available (Why is that?)
- Concurrent regular expressions and their relationship to Petri nets
- A survey of two-dimensional automata theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Algebraic and graph-theoretic properties of infiniten-posets
- Definable transductions and weighted logics for texts
- Axiomatizing the identities of binoid languages
- A note on identities of two-dimensional languages
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- A Kleene theorem for bisemigroup and binoid languages
- Automata on infinite biposets
This page was built for publication: Regular binoid expressions and regular binoid languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401404)
