278 search results - page 16 / 56 » Enumerating Regular Expressions and Their Languages |
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
KES
2008
Springer
13 years 7 months ago
2008
Springer
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
ICTAC
2007
Springer
14 years 1 months ago
2007
Springer
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
CALCO
2005
Springer
14 years 1 months ago
2005
Springer
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...