3724 search results - page 13 / 745 » Timed regular expressions |
NJC
2000
13 years 7 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
BMCBI
2007
13 years 7 months ago
2007
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
WIA
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.