Operational complexity in subregular classes

DOI10.1007/978-3-031-40247-0_11OpenAlexW4385705534MaRDI QIDQ6199871

Michal Hospodár, Galina Jirásková

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversal of binary regular languages
• State complexity of basic operations on suffix-free regular languages
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• Quotient complexity of closed languages
• Quotient complexity of ideal languages
• Closure properties of subregular languages under operations
• Operations on subregular languages and nondeterministic state complexity
• Determination of finite automata accepting subregular languages
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
• Ultimate-Definite and Symmetric-Definite Events and Automata

This page was built for publication: Operational complexity in subregular classes