Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In this aricle we analyze a mechanism for automatic reactions to environment changes. In this case, an association automaton should react not only upon a known situation structure but should also create new associations with their properties (attributes). We assume that all perceptions can be sent to all so-called nodes of association. Every association is represented by its name. Every association is evoked by a set of generators based on different sets of attributes. The analysis regards the life, creation and annihilation of associations and the influences on their changes in perception.
Słowa kluczowe
Rocznik
Tom
Strony
205--215
Opis fizyczny
Bibliogr. 8 poz., rys.
Twórcy
autor
- Czestochowa University of Technology, Poland, h.piech@adm.pcz.czest.pl
Bibliografia
- [1] Büchi J.R., Weak second-order arithmetic and finite automata, Z. Math. Logik Grundl. Math. 1960, 6, 66-92.
- [2] Piech H., Sequence Automata for Researching Concencuse Levels, Lecture Networks in Artificial Intelligence 2011, 6682, 251-261.
- [3] Rabin M.O., Probabilistic automata, Inform. Control. 1963, 6, 230-245.
- [4] Thierrin G., Permutation automata, Mathematical Systems Theory 1968, 2(1), 83-90.
- [5] Remage I., Battle for Free Mind, George Allen &Unwin, London 1967.
- [6] Crutcheld J.P., Mitchell M., The evolution of emergent computation, Proc. Natl. Acad. Sci. 1995, 92, 10742-10746.
- [7] Shukla W., Srivastava A.K., A topology for automata: a note, Inf. Control 1976, 32, 163-168.
- [8] Ying M.S., Automata theory based on quantum logic(I), Int. J. Theor. Phys. 2000, 39, 981-991.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPC6-0016-0022