Partial word DFAs

DOI10.1007/978-3-642-39274-0_5zbMATH Open1298.68123OpenAlexW2130643465MaRDI QIDQ5327481FDOQ5327481

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (2)

• On the state complexity of partial word DFAs
• Title not available (Why is that?)

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)