On the state complexity of partial word DFAs

DOI10.1016/j.tcs.2015.01.021zbMath1407.68247OpenAlexW1997453642MaRDI QIDQ2344741

Matthew Kilgore, Francine Blanchet-Sadri, B. J. Wyatt, Eric Balkanski

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.021

zbMATH Keywords

automatadeterministic finite automataformal languagesregular languagesstate complexitynon-deterministic finite automatapartial wordspartial languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

State complexity of finite partial languages, State complexity of partial word finite automata, State complexity of finite partial languages

Uses Software

• OEIS

Cites Work

• Regular languages of partial words
• Partial words and a theorem of Fine and Wilf
• Algorithmic Combinatorics on Partial Words
• Partial Word DFAs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item