On the decidability of infix inclusion problem

DOI10.1007/978-3-031-05578-2_9OpenAlexW4285173793MaRDI QIDQ2163987

Hyunjoon Cheon, Yo-Sub Han, Joonghyuk Hahn

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_9

zbMATH Keywords

decidabilitycontext-free languagesregular languagesinfix inclusion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

How to settle the ReDoS problem: back to the classical automata theory

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deletion operations on deterministic families of automata
• 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
• On the Density of Context-Free and Counter Languages
• Visibly Pushdown Automata: Universality and Inclusion via Antichains
• Computational Complexity
• Programming Techniques: Regular expression search algorithm

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