Generalizations of Code Languages with Marginal Errors.
Saved in:
| Title: | Generalizations of Code Languages with Marginal Errors. |
|---|---|
| Authors: | Ko, Sang-Ki1 (AUTHOR) sangkiko@kangwon.ac.kr, Han, Yo-Sub2 (AUTHOR) emmous@yonsei.ac.kr, Salomaa, Kai3 (AUTHOR) ksalomaa@cs.queensu.ca |
| Source: | International Journal of Foundations of Computer Science. Aug2021, Vol. 32 Issue 5, p509-529. 21p. |
| Subjects: | Generalization, Language & languages, Suffixes & prefixes (Grammar), Algorithms, Decision making |
| Abstract: | The k -prefix-free, k -suffix-free and k -infix-free languages generalize the prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k -prefix-free language L can be a prefix of up to k different strings in L. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k -prefix-free, k -suffix-free or k -infix-free, and analyze the time complexity of the algorithms. We establish undecidability results for deciding these properties for (linear) context-free languages. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 151853248 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Generalizations of Code Languages with Marginal Errors. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ko%2C+Sang-Ki%22">Ko, Sang-Ki</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sangkiko@kangwon.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Han%2C+Yo-Sub%22">Han, Yo-Sub</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> emmous@yonsei.ac.kr</i><br /><searchLink fieldCode="AR" term="%22Salomaa%2C+Kai%22">Salomaa, Kai</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> ksalomaa@cs.queensu.ca</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Foundations+of+Computer+Science%22">International Journal of Foundations of Computer Science</searchLink>. Aug2021, Vol. 32 Issue 5, p509-529. 21p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Generalization%22">Generalization</searchLink><br /><searchLink fieldCode="DE" term="%22Language+%26+languages%22">Language & languages</searchLink><br /><searchLink fieldCode="DE" term="%22Suffixes+%26+prefixes+%28Grammar%29%22">Suffixes & prefixes (Grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Decision+making%22">Decision making</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The k -prefix-free, k -suffix-free and k -infix-free languages generalize the prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k -prefix-free language L can be a prefix of up to k different strings in L. We also define finitely prefix-free languages in which a string x can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is k -prefix-free, k -suffix-free or k -infix-free, and analyze the time complexity of the algorithms. We establish undecidability results for deciding these properties for (linear) context-free languages. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=151853248 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1142/S0129054121410057 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 509 Subjects: – SubjectFull: Generalization Type: general – SubjectFull: Language & languages Type: general – SubjectFull: Suffixes & prefixes (Grammar) Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Decision making Type: general Titles: – TitleFull: Generalizations of Code Languages with Marginal Errors. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ko, Sang-Ki – PersonEntity: Name: NameFull: Han, Yo-Sub – PersonEntity: Name: NameFull: Salomaa, Kai IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2021 Type: published Y: 2021 Identifiers: – Type: issn-print Value: 01290541 Numbering: – Type: volume Value: 32 – Type: issue Value: 5 Titles: – TitleFull: International Journal of Foundations of Computer Science Type: main |
| ResultId | 1 |
