35 search results - page 1 / 7 » fsttcs 2010 |
62
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
68
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
54
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
107
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...