Square on Deterministic, Alternating, and Boolean Finite Automata
From MaRDI portal
Publication:5205045
DOI10.1142/S0129054119400318zbMATH Open1427.68147OpenAlexW2974340899WikidataQ127227216 ScholiaQ127227216MaRDI QIDQ5205045FDOQ5205045
Authors: Galina Jirásková, Ivana Krajňáková 
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054119400318
Recommendations
- Square on deterministic, alternating, and Boolean finite automata
- scientific article; zbMATH DE number 1098621
- On the square of regular languages
- Squares of regular languages
- Local squares, periodicity and finite automata
- scientific article; zbMATH DE number 1949657
- Operations on Boolean and alternating finite automata
- scientific article; zbMATH DE number 3911710
- Automata and square complexes.
- On the computability of the set of automorphisms of the unit square
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?)
- On equations for regular languages, finite automata, and sequential networks
- State complexity of power
- Title not available (Why is that?)
- The state complexity of \(L^{2}\) and \(L^k\)
- Succinct representation of regular languages by Boolean automata
- Constructions for alternating finite automata∗
- On the square of regular languages
- Descriptional Complexity of Operations on Alternating and Boolean Automata
Cited In (5)
This page was built for publication: Square on Deterministic, Alternating, and Boolean Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205045)
