On the decidability of infix inclusion problem

DOI10.1007/s00224-023-10160-wzbMath1547.68314MaRDI QIDQ6580072

Joonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han

Publication date: 29 July 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

decidabilityformal languagesinfix inclusion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Efficient inclusion checking for deterministic tree automata and XML schemas
• On the decidability of infix inclusion problem
• STATE COMPLEXITY OF CODE OPERATORS
• Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
• Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
• Visibly pushdown languages
• State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
• Alternation
• Distinguishability Operations and Closures
• Visibly Pushdown Automata: Universality and Inclusion via Antichains
• Computational Complexity
• Programming Techniques: Regular expression search algorithm
• Input-driven pushdown automata for edit distance neighborhood
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decidability of infix inclusion problem