Sciweavers

Share
FSTTCS
2010
Springer

Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete

8 years 4 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 languages, and deterministic B
Sven Schewe
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where FSTTCS
Authors Sven Schewe
Comments (0)
books