메뉴 건너뛰기




Volumn , Issue , 2001, Pages 722-731

Computing with continuous-time Liapunov systems

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; CONSTRAINT THEORY; LOGIC GATES; LYAPUNOV METHODS;

EID: 0034824484     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (33)
  • 1
    • 85027409295 scopus 로고
    • On some relations between dynamical systems and transition systems
    • Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (Jerusalem, July), Springer-Verlag, Berlin
    • (1994) LNCS , vol.820 , pp. 59-72
    • Asarin, E.1    Maler, O.2
  • 5
    • 0030586641 scopus 로고    scopus 로고
    • The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction
    • (1996) Neural Computation , vol.8 , pp. 1135-1178
    • Casey, M.1
  • 14
    • 84947803525 scopus 로고
    • Optimal simulation of automata by neural nets
    • Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (Munich, March), Springer-Verlag, Berlin
    • (1995) LNCS , vol.900 , pp. 337-348
    • Indyk, P.1
  • 20
    • 0020495603 scopus 로고
    • Modelling cellular automata with partial differential equations
    • (1984) Physica , vol.10 D , pp. 128-134
    • Omohundro, S.1
  • 22
    • 84958057046 scopus 로고    scopus 로고
    • The computational power of continuous time neural networks
    • Proceedings of the 24th SOFSEM Seminar on Current Trends in Theory and Practice of Informatics (Milovy, Czech Republic, November). Springer-Verlag, Berlin
    • (1997) LNCS , vol.1338 , pp. 86-103
    • Orponen, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.