Minimal consistent DFA from sample strings
type: Item
instance of: scholarly article
title: Minimal consistent DFA from sample strings
author: Chenyi Zhang
published in: Acta Informatica
publication date: 2020-05-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 7203622
MaRDI profile type: MaRDI publication profile
full work available at URL: s00236-020-00365-8
OpenAlex ID: W3023881817
cites work: On the complexity of minimum inference of regular sets
cites work: Learning regular sets from queries and counterexamples
cites work: Occam's razor
cites work: Minimal cover-automata for finite languages
cites work: Characteristic sets for polynomial grammatical inference
cites work: Q4198056
cites work: Polynomial characteristic sets for \(DFA\) identification
cites work: Language identification in the limit
cites work: Complexity of automaton identification from given data
cites work: From bisimulation to simulation: Coarsest partition problems
cites work: Learning DFA from simple examples
cites work: The minimum consistent DFA problem cannot be approximated within any polynomial
cites work: Q3214824
cites work: A theory of the learnable
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Correcting a Space-Efficient Simulation Algorithm
cites work: Minimal consistent DFA revisited
DOI: 10.1007/S00236-020-00365-8
Recommended article: The minimum consistent DFA problem cannot be approximated within any polynomial
Recommended article: Minimizing nfa's and regular expressions
Recommended article: Minimal consistent DFA revisited
Recommended article: Efficient algorithms for the inference of minimum size DFAs
Recommended article: STACS 2005
description: scientific article; zbMATH DE number 7203622