Regular inference as vertex coloring
type: Item
instance of: scholarly article
title: Regular inference as vertex coloring
zbMATH Open document ID: 1360.68524
author: Christophe Costa Florêncio
author: Sicco Verwer
published in: Theoretical Computer Science
publication date: 2014-10-31T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6362893
zbMATH Keywords: grammar induction
zbMATH Keywords: automata induction
zbMATH Keywords: vertex coloring
zbMATH Keywords: satisfiability
zbMATH Keywords: identification in the limit
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.09.023
OpenAlex ID: W2178594919
cites work: Regular Inference as Vertex Coloring
cites work: Q3404129
cites work: On the complexity of minimum inference of regular sets
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Exact DFA Identification Using SAT Solvers
cites work: Q5503674
cites work: On the Synthesis of Finite-State Machines from Samples of Their Behavior
cites work: Inferring Network Invariants Automatically
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: A survey on vertex coloring problems
cites work: Efficient algorithms for the inference of minimum size DFAs
cites work: Grammatical Inference: Algorithms and Applications
cites work: Inference of regular languages using state merging algorithms with search
cites work: Learning Automata Teams
cites work: A Multivariate Analysis of Some DFA Problems
cites work: On the computational complexity of approximating distributions by probabilistic automata
cites work: Complexity of automaton identification from given data
cites work: Set Partitioning via Inclusion-Exclusion
cites work: 3-coloring in time
cites work: Enumerating maximal independent sets with applications to graph colouring.
cites work: On the Shannon capacity of a graph
cites work: The sandwich theorem
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Characterizing PAC-learnability of semilinear sets
cites work: Q3002782
cites work: Proof verification and the hardness of approximation problems
cites work: Approximate graph coloring by semidefinite programming
cites work: Q3216686
cites work: The strong perfect graph theorem
DOI: 10.1016/J.TCS.2014.09.023
description: scientific article; zbMATH DE number 6362893