Abstract
Adaptive technologies [1] are based on the self-modifying property of some systems, which give their users a powerful facility for expressing and handling complex problems. One may turn a rule-based formalism into a corresponding adaptive one by attaching adaptive actions to their rules. This work focuses adaptive automata, and adaptive formalism based on structured pushdown automata. Its transitions may hold adaptive actions responsible for self-modifications. An example ilustrates an adaptive-automata-based solution to an example problem focusing the copy language, an interesting context-dependent language.
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
References
Shutt, J.N.-Self-modifying finite automata-Power and limitations. Technical Report WPI-CS-TR-95-4. Worcester Polytechnic Institute, Worcester, Massachusetts, Dec. 1995
José Neto, J.-Adaptive Automata for context-sensitive languages-ACM SIGPLAN Notices, Nov. 1994
José Neto, J.-Contribuiç ões para a metodologia de construç ão de compiladores-Thesis-Escola Politécnica da Univ. de S. Paulo-1990 (in Portuguese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neto, J.J. (2001). Solving Complex Problems Efficiently with Adaptive Automata. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_35
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive