Regular languages of partial words

DOI10.1016/j.ins.2013.12.032zbMath1341.68086OpenAlexW2028310835MaRDI QIDQ726150

Robert Mercaş, Florin Manea, Juergen Dassow

Publication date: 8 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.12.032

zbMATH Keywords

automata theoryregular languagefinite automatonpartial wordlanguage of partial words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Generic normal cloud model, State complexity of finite partial languages, State complexity of partial word finite automata, On the state complexity of partial word DFAs, State complexity of finite partial languages

Cites Work

• Codes, orderings, and partial words
• Partial words and a theorem of Fine and Wilf
• Freeness of partial words
• Connecting Partial Words and Regular Languages
• Restorations of punctured languages and similarity of languages
• Hard Counting Problems for Partial Words
• Algorithmic Combinatorics on Partial Words
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item