759 search results - page 21 / 152 » Odometers on Regular Languages |
FORMATS
2006
Springer
14 years 1 months ago
2006
Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a ...
APIN
2000
13 years 9 months ago
2000
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
ER
2007
Springer
14 years 4 months ago
2007
Springer
Organizations are under increasing scrutiny to document their compliance to regulatory requirements. To this end, they have to formally document their operating procedures to supp...
IMSCCS
2006
IEEE
14 years 3 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
ICLP
2007
Springer
14 years 3 months ago
2007
Springer
