732 search results - page 112 / 147 » Axiomatising timed automata |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
ENTCS
2008
13 years 7 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
ENTCS
2006
13 years 7 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
IPL
2008
13 years 7 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...
CPM
1999
Springer
13 years 12 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...