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, equivalence, a...

Popoln opis

Bibliografske podrobnosti

Principais autores:	Lorenzo Clemente, Richard Mayr
Format:	Artigo
Jezik:	Inglês
Izdano:	Logical Methods in Computer Science e.V. 2019-02-01
Serija:	Logical Methods in Computer Science
Teme:	computer science - formal languages and automata theory computer science - logic in computer science d.2.4 f.1.1
Online dostop:	https://lmcs.episciences.org/4108/pdf
Oznake:	Označite Brez oznak, prvi označite!