DSpace at KISTKIST Conference Paper2007

Full metadata record

DC Field Value Language
dc.contributor.authorHan, Yo-Sub-
dc.contributor.authorSalomaa, Kai-
dc.date.accessioned2024-01-19T13:38:36Z-
dc.date.available2024-01-19T13:38:36Z-
dc.date.created2022-03-07-
dc.date.issued2007-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://pubs.kist.re.kr/handle/201004/116409-
dc.description.abstractWe investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.-
dc.languageEnglish-
dc.publisherSPRINGER-VERLAG BERLIN-
dc.titleState complexity of basic operations on suffix-free regular languages-
dc.typeConference-
dc.description.journalClass1-
dc.identifier.bibliographicCitation32nd International Symposium on Mathematical Foundations of Computer Science, v.4708, pp.501 - +-
dc.citation.title32nd International Symposium on Mathematical Foundations of Computer Science-
dc.citation.volume4708-
dc.citation.startPage501-
dc.citation.endPage+-
dc.citation.conferencePlaceGE-
dc.citation.conferencePlaceCesky Krumlov, CZECH REPUBLIC-
dc.citation.conferenceDate2007-08-26-
dc.relation.isPartOfMATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS-
dc.identifier.wosid000250380200044-
dc.identifier.scopusid2-s2.0-38049089885-
dc.type.docTypeProceedings Paper-
Appears in Collections:
KIST Conference Paper > 2007
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