Fundamentals of Computation Theory
-
Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings
By Rusins FreivaldsThis paper considers interrelations between universal algebra, algebraic logic, geometry and computer science. The key idea of the paper is to show that problems, coming from computer science, require introducing of highly non-trivial ...
-
Fundamentals of Computation Theory: 18th International Symposium, FCT 2011, Oslo, Norway, August 22-28, 2011, Proceedings
By Olaf Owe, Martin Steffen, Jan Arne TelleTrojan horse, Spyware, Trap Door and Logic Bomb. Here we group together those malware that do not exhibit an infection behavior. A Trojan horse is a non-replicating program that hides its malicious intent inside host programs that may ...
-
Fundamentals of Computation Theory: 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009, Proceedings
By Witold CharatonikJanicki, R.: Relational Structures Model of Concurrency. Acta Informatica 45(4), 279–320 (2008) 10. Janicki, R., Koutny, M.: Invariants and Paradigms of Concurrency Theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991.
-
Fundamentals of Computation Theory: 9th International Conference, FCT '93, Szeged, Hungary, August 23-27, 1993. Proceedings
By Zoltán Ésik... label 1 and the root of 7 + 1 are ' gummed ' together at their roots . Note that red ( ) = • 1 . In the case ( A2 ) , the extended binary tree Thin appearing in TЄB [ AMOK ] has more than one node ( i.e. || T || ut > 1 ) . Here , T ; Є ...
-
Fundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981
By F. GecsegFundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981
-
Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings
By Ralf Klasing, Marc Zeitoun... problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an ... solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space ...