The complexity of concatenation on deterministic and alternating finite automata
From MaRDI portal
Publication:5223613
DOI10.1051/ITA/2018011zbMATH Open1486.68096OpenAlexW2913798541WikidataQ128539404 ScholiaQ128539404MaRDI QIDQ5223613FDOQ5223613
Authors: Michal Hospodár, Galina Jirásková 
Publication date: 18 July 2019
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2018011
Recommendations
- Concatenation of regular languages and descriptional complexity
- Concatenation of Regular Languages and Descriptional Complexity
- Implementation and Application of Automata
- Concatenation operations and restricted variants of two-dimensional automata
- State complexity of the concatenation of regular tree languages
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Multiple concatenation and state complexity (extended abstract)
- The complexity of languages resulting from the concatenation operation
- The Complexity of Languages Resulting from the Concatenation Operation
- The state complexity of alternating automata
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- On equations for regular languages, finite automata, and sequential networks
- State complexity of some operations on binary regular languages
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Title not available (Why is that?)
- Succinct representation of regular languages by Boolean automata
- Constructions for alternating finite automata∗
- On generalized language equations
- Descriptional Complexity of Operations on Alternating and Boolean Automata
Cited In (11)
- The Complexity of Languages Resulting from the Concatenation Operation
- Concatenation operations and restricted variants of two-dimensional automata
- The state complexity of alternating automata
- Alternation in two-way finite automata
- Title not available (Why is that?)
- Concatenation of Regular Languages and Descriptional Complexity
- Operations on Boolean and Alternating Finite Automata
- Concatenation of regular languages and descriptional complexity
- A new technique for reachability of states in concatenation automata
- The complexity of languages resulting from the concatenation operation
- Descriptional complexity of \(h\)-alternating finite automata
This page was built for publication: The complexity of concatenation on deterministic and alternating finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223613)
