Regular inference as vertex coloring
From MaRDI portal
Publication:465248
DOI10.1016/j.tcs.2014.09.023zbMath1360.68524OpenAlexW2178594919MaRDI QIDQ465248
Christophe Costa Florêncio, Sicco Verwer
Publication date: 31 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.023
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating maximal independent sets with applications to graph colouring.
- The strong perfect graph theorem
- The ellipsoid method and its consequences in combinatorial optimization
- On the computational complexity of approximating distributions by probabilistic automata
- Some simplified NP-complete graph problems
- The sandwich theorem
- Characterizing PAC-learnability of semilinear sets
- Inference of regular languages using state merging algorithms with search
- A survey on vertex coloring problems
- Proof verification and the hardness of approximation problems
- Regular Inference as Vertex Coloring
- Set Partitioning via Inclusion-Exclusion
- Learning Automata Teams
- Exact DFA Identification Using SAT Solvers
- Inferring Network Invariants Automatically
- Approximate graph coloring by semidefinite programming
- Complexity of automaton identification from given data
- On the complexity of minimum inference of regular sets
- On the Shannon capacity of a graph
- Cryptographic limitations on learning Boolean formulae and finite automata
- 3-coloring in time
- A Multivariate Analysis of Some DFA Problems
- Grammatical Inference: Algorithms and Applications
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Efficient algorithms for the inference of minimum size DFAs
This page was built for publication: Regular inference as vertex coloring
