759 search results - page 43 / 152 » Overlap-Free Regular Languages |
PFE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Product family architectures need to be captured much like “regular” software architectures. Unfortunately, representations for product family architectures are scarc...
FORMATS
2006
Springer
15 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
14 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...
114
click to vote
ER
2007
Springer
15 years 3 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...
115
click to vote
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...