512 search results - page 72 / 103 » Automata as Abstractions |
DLT
2007
13 years 11 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
FUIN
2006
13 years 10 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
IPL
2008
13 years 10 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
DLT
2009
13 years 8 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
CDB
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Long DNA sequences have to be cut using restriction enzymes into small fragments whose lengths and/or nucleotide sequences can be analyzed by currently available technolo...