DSpace at KISTKIST Conference Paper2009

Full metadata record

DC Field Value Language
dc.contributor.authorHan, Yo-Sub-
dc.contributor.authorSalomaa, Kai-
dc.contributor.authorYu, Sheng-
dc.date.accessioned2024-01-19T13:08:26Z-
dc.date.available2024-01-19T13:08:26Z-
dc.date.created2022-03-07-
dc.date.issued2009-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://pubs.kist.re.kr/handle/201004/116065-
dc.description.abstractWe investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finite-state automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union. star-of-intersection, star-of-reversal and star-of-catenation.-
dc.languageEnglish-
dc.publisherSPRINGER-VERLAG BERLIN-
dc.titleState Complexity of Combined Operations for Prefix-Free Regular Languages-
dc.typeConference-
dc.identifier.doi10.1007/978-3-642-00982-2_34-
dc.description.journalClass1-
dc.identifier.bibliographicCitation3rd International Conference on Language and Automata Theory and Applications, v.5457, pp.398 - +-
dc.citation.title3rd International Conference on Language and Automata Theory and Applications-
dc.citation.volume5457-
dc.citation.startPage398-
dc.citation.endPage+-
dc.citation.conferencePlaceGE-
dc.citation.conferencePlaceTarragona, SPAIN-
dc.citation.conferenceDate2009-04-02-
dc.relation.isPartOfLANGUAGE AND AUTOMATA THEORY AND APPLICATIONS-
dc.identifier.wosid000265784300034-
dc.type.docTypeProceedings Paper-
Appears in Collections:
KIST Conference Paper > 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