2016•Lecture notes in computer scienceOpen access
Self-Verifying Finite Automata and Descriptional Complexity
Galina Jirásková
Open full text 0 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Galina Jirásková
Abstract
An abstract is not available in the OpenAlex record for this paper.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Computer science, Deterministic finite automaton, Quantum finite automata, Automaton, ω-automaton, Finite-state machine, DFA minimization, Automata theory