DSpace at KISTKIST Article2009

Full metadata record

DC Field Value Language
dc.contributor.authorHan, Yo-Sub-
dc.contributor.authorSalomaa, Kai-
dc.contributor.authorWood, Derick-
dc.date.accessioned2024-01-20T22:03:43Z-
dc.date.available2024-01-20T22:03:43Z-
dc.date.created2021-09-03-
dc.date.issued2009-01-
dc.identifier.issn0169-2968-
dc.identifier.urihttps://pubs.kist.re.kr/handle/201004/132834-
dc.description.abstractWe investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.-
dc.languageEnglish-
dc.publisherIOS PRESS-
dc.subjectGENERALIZED AUTOMATA-
dc.titleNondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages-
dc.typeArticle-
dc.identifier.doi10.3233/FI-2009-0008-
dc.description.journalClass1-
dc.identifier.bibliographicCitationFUNDAMENTA INFORMATICAE, v.90, no.1-2, pp.93 - 106-
dc.citation.titleFUNDAMENTA INFORMATICAE-
dc.citation.volume90-
dc.citation.number1-2-
dc.citation.startPage93-
dc.citation.endPage106-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.identifier.wosid000264096600008-
dc.identifier.scopusid2-s2.0-61449184670-
dc.relation.journalWebOfScienceCategoryComputer Science, Software Engineering-
dc.relation.journalWebOfScienceCategoryMathematics, Applied-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaMathematics-
dc.type.docTypeArticle-
dc.subject.keywordPlusGENERALIZED AUTOMATA-
dc.subject.keywordAuthorprefix-freeness-
dc.subject.keywordAuthorregular languages-
dc.subject.keywordAuthornondeterministic state complexity-
dc.subject.keywordAuthordescriptional complexity-
Appears in Collections:
KIST Article > 2009
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show Simple Item Record

qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE