Open Access. Powered by Scholars. Published by Universities.®
Academic -- UNF -- Mathematics; Finite State Automata; Regular Languages; Subword Closure; Involution Mappings; Strictly Locally Testable Languages; DNA Code Words
Articles 1 - 1 of 1
Full-Text Articles in Other Mathematics
Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones
Maximality And Applications Of Subword-Closed Languages, Rhys Davis Jones
UNF Graduate Theses and Dissertations
Characterizing languages D that are maximal with the property that D* ⊆ S⊗ is an important problem in formal language theory with applications to coding theory and DNA codewords. Given a finite set of words of a fixed length S, the constraint, we consider its subword closure, S⊗, the set of words whose subwords of that fixed length are all in the constraint. We investigate these maximal languages and present characterizations for them. These characterizations use strongly connected components of deterministic finite automata and lead to polynomial time algorithms for generating such languages. We prove that …