Minimal partial languages and automata

DOI10.1007/978-3-319-08846-4_8MaRDI QIDQ3192256zbMATH OpenOpenAlexFDO

Authors Kira Goldner, Aidan Shackleton, F. Blanchet-Sadri

Publication date 26 September 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-08846-4_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimal partial languages and automata
• On the state complexity of partial word DFAs
• Partial word DFAs
• Incremental construction of minimal deterministic finite cover automata
• On the Computational Complexity of Partial Word Automata Problems

Cited in

(8)

• scientific article; zbMATH DE number 4108164 (Why is no real title available?)
• On the state complexity of partial word DFAs
• Minimal NFA and biRFSA Languages
• Minimal partial languages and automata
• Markers and deterministic acceptors for non-deterministic languages
• Bideterministic Automata and Minimal Representations of Regular Languages
• scientific article; zbMATH DE number 2087235 (Why is no real title available?)
• Minimizing positive integer sequences without duplicate substrings

This page was built for publication: Minimal partial languages and automata

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