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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 15, Issue 1
Main Authors:	Clemente, Lorenzo, Mayr, Richard
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2019
Subjects:	computer science - formal languages and automata theory computer science - logic in computer science d.2.4 f.1.1
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!