Adaptive automata for context-dependent languages
ACM SIGPLAN Notices
PC AI
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Elements of the Theory of Computation
Elements of the Theory of Computation
Adaptive Rule-Driven Devices - General Formulation and Case Study
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Computer
Instrumentation in software dynamic translators for self-managed systems
WOSS '04 Proceedings of the 1st ACM SIGSOFT workshop on Self-managed systems
Hi-index | 0.00 |
Adaptive devices show the characteristic of dynamically change themselves in response to input stimuli with no interference of external agents. Occasional changes in behaviour are immediately detected by the devices, which right away react spontaneously to them. Chronologically such devices derived from researches in the field of formal languages and automata. However, formalism spurred applications in several other fields. Based on the operation of adaptive automata, the elementary ideas generating programming adaptive languages are presented.