Minimal consistent DFA revisited

DOI10.1016/j.tcs.2016.07.023zbMath1350.68177DBLPjournals/tcs/PargaGL16OpenAlexW2480486330WikidataQ58209324 ScholiaQ58209324MaRDI QIDQ306711

Manuel Vázquez de Parga, Pedro García, Damián López

Publication date: 1 September 2016

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

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

zbMATH Keywords

DFA identificationminimal consistent DFAuniformly-complete sample

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Minimal consistent DFA from sample strings

Cites Work

• Unnamed Item
• Unnamed Item
• On state reduction of incompletely specified finite state machines
• Separating Regular Languages with First-Order Logic
• On Separation by Locally Testable and Locally Threshold Testable Languages
• Learning Minimal Separating DFA’s for Compositional Verification
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers
• Language identification in the limit
• Minimal cover-automata for finite languages

This page was built for publication: Minimal consistent DFA revisited