An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations

Authors:
M. R. Fellows;M. A. Langston
Affiliations:
Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA;-
Venue:
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Year:
1989

Citing 0
Cited 11

On the Complements of Partial k-Trees

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Characterization of Graphs with Vertex Cover Six

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Online promise problems with online width metrics

Journal of Computer and System Sciences
Derivation of algorithms for cutwidth and related graph layout parameters

Journal of Computer and System Sciences
Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization
A parameterized complexity tutorial

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The birth and early years of parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
Kernelization --- preprocessing with a guarantee

The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth

The Multivariate Algorithmic Revolution and Beyond
Probabilistic inference and monadic second order logic

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A theorem that is a graph-theoretic analog of the Myhill-Nerode characterization of regular languages is proved. The theorem is used to establish that for many applications obstruction sets are computable by known algorithms. The focus is exclusively on what is computable (by a known algorithm) in principle, as opposed to what is computable in practice.