Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
MetadataShow full item record
A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages as special cases. We examine complexity properties of these special prefix-convex languages. In particular, we study the quotient/state complexity of boolean operations, product (concatenation), star, and reversal, the size of the syntactic semi group, and the quotient complexity of atoms. For binary operations we use arguments with different alphabets when appropriate; this leads to higher tight upper bounds than those obtained with equal alphabets. We exhibit right-ideal, prefix-closed, and prefix-free languages that meet the complexity bounds for all the measures listed above.
Cite this version of the work
Janusz Brzozowski, Corwin Sinnamon (2017). Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages. UWSpace. http://hdl.handle.net/10012/12530
Showing items related by title, author, creator and subject.
Nicholson, Patrick (University of Waterloo, 2009-04-30)Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ...
Daigle, Alexandre (University of Waterloo, 2016-05-16)In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the heavy-path strategy produces the optimal trie with respect ...
Brzozowski, Janusz; Szykuła, Marek; Ye, Yuli (Springer, 2017-08-04)The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...