On the computational complexity of partial word automata problems

Kurzanzeige
dc.contributor.authorHolzer, Markus
dc.contributor.authorJakobi, Sebastian
dc.contributor.authorWendlandt, Matthias
dc.date.accessioned2022-09-12T09:38:36Z
dc.date.available2014-09-03T12:58:20Z
dc.date.available2022-09-12T09:38:36Z
dc.date.issued2014
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:hebis:26-opus-110584
dc.identifier.urihttps://jlupub.ub.uni-giessen.de//handle/jlupub/7532
dc.identifier.urihttp://dx.doi.org/10.22029/jlupub-6966
dc.language.isoende_DE
dc.relation.ispartofseriesIFIG Research Report; 1404
dc.rightsIn Copyright*
dc.rights.urihttp://rightsstatements.org/page/InC/1.0/*
dc.subjectpartial wordsen
dc.subjectfinite automataen
dc.subjectcomputational complexityen
dc.subjectlanguage problemsen
dc.subjectminimization problemen
dc.subject.ddcddc:004de_DE
dc.titleOn the computational complexity of partial word automata problemsde_DE
dc.typeworkingPaperde_DE
local.affiliationFB 07 - Mathematik und Informatik, Physik, Geographiede_DE
local.opus.fachgebietInformatikde_DE
local.opus.id11058
local.opus.instituteInstitut für Informatikde_DE

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
Ifig_Report1404.pdf
Größe:
379.97 KB
Format:
Adobe Portable Document Format
Herunterladen

Sammlungen

IFIG Research Report