Corpus ID: 212675410

Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata

@article{Wolf2020RegularIE,
  title={Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata},
  author={P. Wolf and H. Fernau},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.05826}
}
  • P. Wolf, H. Fernau
  • Published 2020
  • Computer Science
  • ArXiv
  • The Int_reg-problem of a combinatorial problem P asks, given a nondeterministic automaton M as input, whether the language L(M) accepted by M contains any positive instance of the problem P. We consider the Int_reg-problem for a number of different graph problems and give general criteria that give decision procedures for these Int_reg-problems. To achieve this goal, we consider a natural graph encoding so that the language of all graph encodings is regular. Then, we draw the connection between… CONTINUE READING
    2 Citations
    From Decidability to Undecidability by Considering Regular Sets of Instances
    • 1
    • Highly Influenced
    • PDF
    Technical Report Column

    References

    SHOWING 1-10 OF 29 REFERENCES
    From Decidability to Undecidability by Considering Regular Sets of Instances
    • 1
    • PDF
    Some Simplified NP-Complete Graph Problems
    • 2,032
    Node-and edge-deletion NP-complete problems
    • 439
    • PDF
    On regular realizability problems for context-free languages
    • 3
    Orbits of Linear Maps and Regular Languages
    • 10
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,263
    • PDF
    Regular realizability problems and regular languages
    • 3
    • PDF
    Regular realizability problems and models of a generalized nondeterminism
    • 3
    • PDF