The cut operation in subclasses of convex languages (extended abstract)

DOI10.1007/978-3-031-07469-1_12MaRDI QIDQ2164745zbMATH OpenOpenAlexFDO

Authors Michal Hospodár, Viktor Olejár

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07469-1_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• Analyzing catastrophic backtracking behavior in practical regular expression matching
• Cuts in regular expressions
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Operational state complexity of prefix-free regular languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of ideal languages
• State complexity of basic operations on suffix-free regular languages
• The range of state complexities of languages resulting from the cut operation
• Tight bounds for cut-operations on deterministic finite automata

Cited in

(2)

• The cut operation in subclasses of convex languages
• Operational complexity: NFA-to-DFA trade-off

This page was built for publication: The cut operation in subclasses of convex languages (extended abstract)

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