Sciweavers

35 search results - page 1 / 7
» fsttcs 2010
Sort
View
FSTTCS
2010
Springer
13 years 2 months ago
Reasoning About Strategies
Fabio Mogavero, Aniello Murano, Moshe Y. Vardi
FSTTCS
2010
Springer
13 years 2 months ago
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
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...
Sven Schewe
FSTTCS
2010
Springer
13 years 2 months ago
Fast equivalence-checking for normed context-free processes
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...
Wojciech Czerwinski, Slawomir Lasota