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

Valuations, regular expressions, and fractal geometry

โœ Scribed by Henning Fernau

Publisher
Springer
Year
1996
Tongue
English
Weight
958 KB
Volume
7
Category
Article
ISSN
0938-1279

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

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