Prefix-free languages: Left and right quotient and reversal
نویسندگان
چکیده
منابع مشابه
Prefix-Free Łukasiewicz Languages
Generalised Łukasiewicz languages are simply described languages having good information-theoretic properties. An especially desirable property is the one of being a prefix code. This paper addresses the question under which conditions a generalised Łukasiewicz language is a prefix code. Moreover, an upper bound on the delay of decipherability of a generalised Łukasiewicz language is derived.
متن کاملPrefix-free regular languages and pattern matching
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 whet...
متن کاملLearning Left-to-Right and Right-to-Left Iterative Languages
The left-to-right and right-to-left iterative languages are previously unnoticed subclasses of the regular languages of infinite size that are identifiable in the limit from positive data. Essentially, these language classes are the ones obtained by merging final states in a prefix tree and initial states in a suffix tree of the observed sample, respectively. Strikingly, these classes are also ...
متن کاملCharacterizing the Regular Prefix Codes and Right Power-Bounded Languages
This paper was motivated by the work of Thierrin [8], where right power-bounded languages are introduced as those languages L having an upper bound n so that k < n whenever uvk E L with v # X. Such languages are related to various versions of noncounting languages (see, e.g. [ 1,6]). Two natural questions about the family R of regular right-power bounded languages are, first, a characterization...
متن کاملComplexity in Prefix-Free Regular Languages
We examine deterministic and nondeterministic state complexities of regular operations on prefixfree languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the tight bounds on state complexity of symmetric difference, and deterministic and nondeterministic state complexity of difference and cyclic shift of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.08.031