Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carmi, A.: Adapser: An lalr(1) adaptive parser. In: The Israeli Workshop on Programming Languages & Development Environments, Haifa, Israel (July 2002)
de Sousa, M., Hirakawa, A.: Robotic mapping and navigation in unknown environments using adaptive automata. In: Adaptive and Natural Computing Algorithms, Part III, pp. 345–348. Springer, Heidelberg (2005)
Jackson, Q.T.: Adapting to Babel — Adaptivity and Context-Sensitivity in Parsing: From a n b n c n to RNA. Ibis Publications (2006)
Jech, T.J.: About the Axiom of Choice. In: Handbook of Mathematical Logic, pp. 345–370. North-Holland, Amsterdam (1977)
Neto, J.J., Silva, P.S.M.: An adaptive framework for the design of software specification languages. In: Adaptive and Natural Computing Algorithms, Part III, pp. 349–352. Springer, Heidelberg (2005)
Mikolajczak, B. (ed.): Algebraic and Structural Automata Theory. North-Holland, Amsterdam (1991)
Neto, J.J., Pariente, C.A.B.: Adaptive Automata - A Revisited Proposal. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 158–168. Springer, Heidelberg (2003)
de Azevedo da Rocha, R.L.: An Attempt to Express the Semantics of the Adaptive Devices. In: Advances in Technological Applications of Logical and Intelligent Systems - Selected Papers from the Sixth Congress on Logic Applied to Technology. Frontiers in Artificial Intelligence and Applications, vol. 186, pp. 13–27. IOS Press, Amsterdam (2009)
de Azevedo da Rocha, R.L., Neto, J.J.: Adaptive automaton, limits and complexity compared to the Turing machine - in Portuguese. In: Proceedings of the I LAPTEC, pp. 33–48 (October 2000)
de Azevedo da Rocha, R.L., Neto, J.J.: An adaptive finite-state automata application to the problem of reducing the number of states in approximate string matching. In: XI Congreso Argentino de Ciencias de la Computación - CACIC 2005, Concordia, Entre Ríos, Argentina, pp. 17–21 (October 2005)
Rubinstein, R.S., Shutt, J.N.: Self-modifying finite automata. In: IFIP Congress, vol. 1, pp. 493–498 (1994)
Salthe, S., Matsuno, K.: Self-organization in hierarchical systems. Journal of Social and Evolutionary Systems 18(4), 327–338 (1995)
Sragovich, V.G.: Mathematical Theory of Adaptive Control. World Scientific, Singapore (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva Filho, R.I., de Azevedo da Rocha, R.L. (2011). Adaptive Finite Automaton: A New Algebraic Approach. In: Dobnikar, A., Lotrič, U., Šter, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2011. Lecture Notes in Computer Science, vol 6594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20267-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-20267-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20266-7
Online ISBN: 978-3-642-20267-4
eBook Packages: Computer ScienceComputer Science (R0)