Operational complexity in subregular classes
From MaRDI portal
Publication:6199871
DOI10.1007/978-3-031-40247-0_11OpenAlexW4385705534MaRDI QIDQ6199871FDOQ6199871
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
Cites Work
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Title not available (Why is that?)
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Operational state complexity of prefix-free regular languages
- State complexity of basic operations on suffix-free regular languages
- Reversal of binary regular languages
- Title not available (Why is that?)
- Succinct representation of regular languages by Boolean automata
- Determination of finite automata accepting subregular languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Ultimate-Definite and Symmetric-Definite Events and Automata
- Quotient complexity of ideal languages
- Closure properties of subregular languages under operations
- Operations on subregular languages and nondeterministic state complexity
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)
