Operational complexity in subregular classes

DOI10.1007/978-3-031-40247-0_11MaRDI QIDQ6199871zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 2081044 (Why is no real title available?)
• scientific article; zbMATH DE number 3353192 (Why is no real title available?)
• Closure properties of subregular languages under operations
• Determination of finite automata accepting subregular languages
• Operational state complexity of prefix-free regular languages
• Operations on subregular languages and nondeterministic state complexity
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Quotient complexity of bifix-, factor-, and subword-free regular languages
• Quotient complexity of ideal languages
• 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
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Ultimate-Definite and Symmetric-Definite Events and Automata

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

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