Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Yo-Sub | - |
dc.contributor.author | Wang, Yajun | - |
dc.contributor.author | Wood, Derick | - |
dc.date.accessioned | 2024-01-21T00:03:05Z | - |
dc.date.available | 2024-01-21T00:03:05Z | - |
dc.date.created | 2021-09-02 | - |
dc.date.issued | 2007-12-10 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://pubs.kist.re.kr/handle/201004/133886 | - |
dc.description.abstract | We explore the, regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free. (c) 2007 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | GENERALIZED AUTOMATA | - |
dc.subject | ALGORITHM | - |
dc.subject | SEARCH | - |
dc.title | Prefix-free regular languages and pattern matching | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.tcs.2007.10.017 | - |
dc.description.journalClass | 1 | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.389, no.1-2, pp.307 - 317 | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 389 | - |
dc.citation.number | 1-2 | - |
dc.citation.startPage | 307 | - |
dc.citation.endPage | 317 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.identifier.wosid | 000251695800025 | - |
dc.identifier.scopusid | 2-s2.0-36149000603 | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | GENERALIZED AUTOMATA | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordAuthor | string pattern matching | - |
dc.subject.keywordAuthor | regular-expression matching | - |
dc.subject.keywordAuthor | prefix-free regular languages | - |
dc.subject.keywordAuthor | pruned prefix-free languages | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.