๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Regular languages and stone duality

โœ Scribed by N. Pippenger

Book ID
110621111
Publisher
Springer
Year
1997
Tongue
English
Weight
767 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
Regular binoid expressions and regular binoid languages
โœ Kosaburo Hashiguchi; Yoshito Wada; Shuji Jimbo ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

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

Regular splicing languages and subclasse
Regular splicing languages and subclasses
โœ Paola Bonizzoni; Giancarlo Mauri ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB
Squares of regular languages
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.