The cut operation in subclasses of convex languages

DOI10.1016/j.tcs.2023.114050OpenAlexW4382051072MaRDI QIDQ6165559

Michal Hospodár, Viktor Olejár

Publication date: 1 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114050

zbMATH Keywords

operational state complexityconvex languagescut operation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• 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 cut operation in subclasses of convex languages (extended abstract)
• Homomorphic encryption for finite automata
• The range of state complexities of languages resulting from the cut operation
• Nondeterministic complexity in subclasses of convex languages
• 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