On the state complexity of closures and interiors of regular languages with subwords

DOI10.1007/978-3-319-09704-6_21MaRDI QIDQ5496192zbMATH OpenOpenAlexFDO

Authors Prateek Karandikar, Philippe Schnoebelen

Publication date 7 August 2014

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09704-6_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the state complexity of closures and interiors of regular languages with subwords and superwords
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• Power, positive closure, and quotients on convex languages
• Nondeterministic complexity of operations on closed and ideal languages

Cited in

(6)

• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• On upper and lower bounds on the length of alternating towers
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• On the state complexity of scattered substrings and superstrings
• Partial orders on words, minimal elements of regular languages, and state complexity
• On the state complexity of closures and interiors of regular languages with subwords and superwords

This page was built for publication: On the state complexity of closures and interiors of regular languages with subwords

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496192)