Adaptive Finite Automaton: A New Algebraic Approach

Autor:	Ricardo Luis de Azevedo da Rocha, Reginaldo Inojosa da Silva Filho
Rok vydání:	2011
Předmět:	Algebra Deterministic finite automaton Deterministic automaton Powerset construction Continuous automaton Probabilistic automaton Büchi automaton Two-way deterministic finite automaton Nondeterministic finite automaton Algorithm Mathematics
Zdroj:	Adaptive and Natural Computing Algorithms ISBN: 9783642202667 ICANNGA (2)
DOI:	10.1007/978-3-642-20267-4_29
Popis:	The purpose is to present a new and better representation for the adaptive finite automaton and to also show that both formulations - the original and the newly created - have the same computational power. Adaptive finite automaton original formulation was explored and a way to overcome some difficulties found by [7] in its representation and proofs about its computational power were sought. Afterwards both formulations show to be equivalent in representation and in computational power, but the new one has a highly simplified algebraic notation. The use of the new formulation actually allows simpler theorem proofs and generalizations, as can be verified in the last section of the paper.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6060f72f5993b1244786734b883e2e4a https://doi.org/10.1007/978-3-642-20267-4_29 Zobrazit plný text záznamu