Intersection non-emptiness and hardness within polynomial time

DOI10.1007/978-3-319-98654-8_23OpenAlexW2885558565MaRDI QIDQ1622971FDOQ1622971

Authors: Mateus de Oliveira Oliveira, Michael Wehar 

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_23

Recommendations

• Hardness results for intersection non-emptiness
• On the complexity of intersecting regular, context-free, and tree languages
• The emptiness problem for intersections of regular languages
• The intersection problem for finite monoids
• Lengths of words accepted by nondeterministic finite automata

zbMATH Keywords

computational complexityintersection non-emptinessunary automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Title not available (Why is that?)
• Two-dimensional pattern matching against local and regular-like picture languages
• Hardness results for intersection non-emptiness
• Title not available (Why is that?)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
• Title not available (Why is that?)
• Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices

This page was built for publication: Intersection non-emptiness and hardness within polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622971)