3724 search results - page 42 / 745 » Timed regular expressions |
DLT
2010
13 years 9 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
ITICSE
2005
ACM
14 years 1 months ago
2005
ACM
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the i...
SCIENTOMETRICS
2010
13 years 2 months ago
2010
This paper proves two regularities that where found in the paper [V. Larivi
WIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...