2 search results - page 1 / 1 » Finding Shortest Witnesses to the Nonemptiness of Automata o... |
67
Voted
CONCUR
2006
Springer
15 years 2 months ago
2006
Springer
ENTCS
2006
14 years 10 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...