✦ LIBER ✦

Regular expression for a language without empty word

✍ Scribed by Djelloul Ziadi

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 373 KB
Volume: 163
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00028-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular-Language Semantics for a Call-by

Regular-Language Semantics for a Call-by-Value Programming Language

✍ Dan R. Ghica 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB

On the number of occurrences of a symbol

On the number of occurrences of a symbol in words of regular languages

✍ Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

CSLML: a markup language for expressive

CSLML: a markup language for expressive Chinese sign language synthesis

✍ Kejia Ye; Baocai Yin; Lichun Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

A solution of the word problem for free

A solution of the word problem for free ∗-regular semigroups

✍ Libor Polák 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

leads to canonical forms representing elements of the free \* -regular semigroup.

A Subquadratic Algorithm for Approximate

A Subquadratic Algorithm for Approximate Regular Expression Matching

✍ S. Wu; U. Manber; E. Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

The main result of this paper is an algorithm for approximate matching of a regular expression of size \(m\) in a text of size \(n\) in time \(O\left(n m / \log _{d+2} n\right)\), where \(d\) is the number of allowed errors. This algorithm is the first \(o(m n)\) algorithm for approximate matching t

A graph-based regularity test for determ

A graph-based regularity test for deterministic context-free languages

✍ Priti Shankar; B.S. Adiga 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB