Learning of Deterministic Finite Automata at Exact Learning Model
Xia Zhang
Abstract
Xia Zhang
Abstract
Using the relation of multiplicity automata and finite automata,the author gives the learning algorithm of deterministic finite automata at EXACT learning model according to the learning algorithm of multiplicity automata.At the same time,author finalizes the algorithm complexity and draws a conclusion that deterministic finite automata can be learned in polynomial time.
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.
Using the relation of multiplicity automata and finite automata,the author gives the learning algorithm of deterministic finite automata at EXACT learning model according to the learning algorithm of multiplicity automata.At the same time,author finalizes the algorithm complexity and draws a conclusion that deterministic finite automata can be learned in polynomial time.
Key concepts: Quantum finite automata, Deterministic finite automaton, Computer science, Learning automata, Automaton, ω-automaton, Finite-state machine, Multiplicity (mathematics)