The complexity of intersecting finite automata having few final states

DSpace Repository

The complexity of intersecting finite automata having few final states

Author: Blondin, Michael; Krebs, Andreas; McKenzie, Pierre
Tübinger Autor(en):
Krebs, Andreas
Published in: Computational Complexity (2016), Bd. 25, H. 4, S. 775-814
Verlagsangabe: Springer Basel Ag
Language: English
Full text: http://dx.doi.org/10.1007/s00037-014-0089-9
ISSN: 1420-8954
DDC Classifikation: 004 - Data processing and computer science
510 - Mathematics
Dokumentart: Artikel
Show full item record

This item appears in the following Collection(s)