A bisemigroup consists of a set of elements and two associative operations. A bimonoid is a bisemigroup which has an identity to each associative operation. A binoid is a bimonoid which has the same identity to the two associative operations. In a previous paper, we introduced these three notions, a
β¦ LIBER β¦
Regular Languages and Stone Duality
β Scribed by N. Pippenger
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 152 KB
- Volume
- 30
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Regular binoid expressions and regular b
β
Kosaburo Hashiguchi; Yoshito Wada; Shuji Jimbo
π
Article
π
2003
π
Elsevier Science
π
English
β 285 KB
Squares of regular languages
β
Gerhard Lischke
π
Article
π
2005
π
John Wiley and Sons
π
English
β 127 KB
The square of a language L is the set of all words pp where p β L. The square of a regular language may be regular too or context-free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties.
Vector addition systems and regular lang
β
A. Ginzburg; M. Yoeli
π
Article
π
1980
π
Elsevier Science
π
English
β 431 KB
Formulas, regular languages and boolean
β
Pierre PΓ©ladeau
π
Article
π
1992
π
Elsevier Science
π
English
β 701 KB
Algebraic Constraints, Automata, and Reg
β
Bakhadyr Khoussainov
π
Article
π
2000
π
Elsevier Science
π
English
β 840 KB
Incidence structures and StoneβPriestley
β
Mohamed Bekkali; Maurice Pouzet; Driss Zhani
π
Article
π
2007
π
Springer Netherlands
π
English
β 350 KB