On the decidability of infix inclusion problem
From MaRDI portal
Publication:6580072
DOI10.1007/S00224-023-10160-WzbMATH Open1547.68314MaRDI QIDQ6580072FDOQ6580072
Authors: Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han 
Publication date: 29 July 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Computational Complexity
- Title not available (Why is that?)
- Visibly pushdown languages
- Title not available (Why is that?)
- Alternation
- State complexity of code operators
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Programming Techniques: Regular expression search algorithm
- Equivalence and inclusion problem for strongly unambiguous Büchi automata
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- A survey on operational state complexity
- Distinguishability operations and closures
- On the decidability of infix inclusion problem
- Static detection of DoS vulnerabilities in programs that use regular expressions
- Visibly pushdown automata: universality and inclusion via antichains
- Analyzing catastrophic backtracking behavior in practical regular expression matching
- Title not available (Why is that?)
- Input-driven pushdown automata for edit distance neighborhood
Cited In (1)
This page was built for publication: On the decidability of infix inclusion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580072)
