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

DOI10.1007/978-3-031-07469-1_12OpenAlexW4285254330MaRDI QIDQ2164745

Viktor Olejár, Michal Hospodá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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of basic operations on suffix-free regular languages
• Quotient complexity of closed languages
• Quotient complexity of ideal languages
• The range of state complexities of languages resulting from the cut operation
• Tight Bounds for Cut-Operations on Deterministic Finite Automata
• Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
• Cuts in Regular Expressions
• A Method for the Construction of Minimum-Redundancy Codes

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