Partial word DFAs

DOI10.1007/978-3-642-39274-0_5MaRDI QIDQ5327481zbMATH OpenOpenAlexFDO

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

Publication date 7 August 2013

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39274-0_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the state complexity of partial word DFAs
• Minimal partial languages and automata
• On the Computational Complexity of Partial Word Automata Problems
• Connecting partial words and regular languages
• Regular languages of partial words

Cited in

(7)

• On the state complexity of partial word DFAs
• Minimal partial languages and automata
• Regular languages of partial words
• State complexity of finite partial languages
• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• Minimal partial languages and automata
• Connecting partial words and regular languages

This page was built for publication: Partial word DFAs

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