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.
CITATION STYLE
Neto, J. J. (2001). Solving complex problems efficiently with adaptive automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2088, pp. 340–342). Springer Verlag. https://doi.org/10.1007/3-540-44674-5_35
Mendeley helps you to discover research relevant for your work.