dc.contributor.author |
Krebs, Andreas |
|
dc.date.accessioned |
2018-06-19T14:07:34Z |
|
dc.date.available |
2018-06-19T14:07:34Z |
|
dc.date.issued |
2016 |
|
dc.identifier.issn |
1420-8954 |
|
dc.identifier.uri |
http://hdl.handle.net/10900/82791 |
|
dc.language.iso |
en |
en |
dc.publisher |
Springer Basel Ag |
de_DE |
dc.relation.uri |
http://dx.doi.org/10.1007/s00037-014-0089-9 |
|
dc.rights |
info:eu-repo/semantics/closedAccess |
|
dc.subject.ddc |
004 |
de_DE |
dc.subject.ddc |
510 |
de_DE |
dc.title |
The complexity of intersecting finite automata having few final states |
de_DE |
dc.type |
Article |
de_DE |
utue.quellen.id |
20180405102126_00296 |
|
utue.publikation.seiten |
775-814 |
de_DE |
utue.personen.roh |
Blondin, Michael |
|
utue.personen.roh |
Krebs, Andreas |
|
utue.personen.roh |
McKenzie, Pierre |
|
dcterms.isPartOf.ZSTitelID |
Computational Complexity |
de_DE |
dcterms.isPartOf.ZS-Issue |
4 |
de_DE |
dcterms.isPartOf.ZS-Volume |
25 |
de_DE |
utue.fakultaet |
07 Mathematisch-Naturwissenschaftliche Fakultät |
|