Efficient reduction of nondeterministic automata with application to language inclusion testing

We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete automata problems like language universality, equivalen...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 15, Issue 1
Hlavní autori:	Clemente, Lorenzo, Mayr, Richard
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.01.2019
Predmet:	computer science - formal languages and automata theory computer science - logic in computer science d.2.4 f.1.1
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!