2 search results - page 1 / 1 » Finding Shortest Witnesses to the Nonemptiness of Automata o... |
146
click to vote
ENTCS
2006
15 years 6 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...