𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On regular expressions and regular canonical systems

✍ Scribed by Arto Salomaa

Publisher
Springer
Year
1968
Tongue
English
Weight
849 KB
Volume
2
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 canonical covers
Regular canonical covers
✍ Ciro Ciliberto; Rita Pardini; Francesca Tovena πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract We construct three sequences of regular surfaces of general type with unbounded numerical invariants whose canonical map is 2–to–1 onto a canonically embedded surface. Only sporadic examples of surfaces with these properties were previously known.

Rewriting of Regular Expressions and Reg
Rewriting of Regular Expressions and Regular Path Queries
✍ Diego Calvanese; Giuseppe De Giacomo; Maurizio Lenzerini; Moshe Y. Vardi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 189 KB

Recent work on semi-structured data has revitalized the interest in path queries, i.e., queries that ask for all pairs of objects in the database that are connected by a path conforming to a certain specification, in particular to a regular expression. Also, in semi-structured data, as well as in da

GOTO Removal Based on Regular Expression
GOTO Removal Based on Regular Expressions
✍ MORRIS, PAUL H.; GRAY, RONALD A.; FILMAN, ROBERT E. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 241 KB

We present an algorithm for eliminating GOTOs and replacing them with structured IF-THEN-ELSE and loop constructs. Previous approaches have treated GOTO removal as an isolated problem for programming languages. In this paper, we describe a way of reducing GOTO removal to the well-understood problem

Nondeterministic regular expressions as
Nondeterministic regular expressions as solutions of equational systems
✍ Rocco De Nicola; Anna Labella πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 211 KB

We deΓΏne the class of the linear systems whose solution is expressible as a tuple of nondeterministic regular expressions when they are interpreted as trees of actions rather than as sets of sequences. We precisely characterize those systems that have a regular expression as "canonical" solution, an