Listing 1 - 9 of 9 |
Sort by
|
Choose an application
Electronic digital computers --- Ordinateurs --- Formal languages --- Langages formels --- Computer science --- Turing machines --- Informatique --- Turing, Machines de --- Formal languages. --- Computer science. --- Turing machines. --- Automates abstraits --- Automates finis
Choose an application
Computer algorithms --- Data structures (Computer science) --- Computer programming --- Algorithmes --- Structures de données (Informatique) --- Programmation (Informatique) --- Structures de données (Informatique) --- Decidability (Mathematical logic) --- Formal languages --- Recursive functions --- Machine theory --- Computable functions --- Turing machines --- Décidabilité (logique mathématique) --- Langages formels --- Fonctions récursives --- Automates mathématiques, Théorie des --- Fonctions calculables --- Turing, Machines de --- Langages formels. --- Fonctions récursives. --- Automates mathématiques, Théorie des. --- Fonctions calculables. --- Turing, Machines de. --- Décidabilité (logique mathématique) --- Fonctions récursives. --- Automates mathématiques, Théorie des.
Choose an application
Abstract automata --- Abstract machines --- Automata --- Automates [Théorie des ] --- Automates mathématiques [Théorie des ] --- Berekeningen [Ingewikkeldheid van ] --- Calcul [Complexité de ] --- Complexité de calcul --- Computational complexity --- Ingewikkeldheid van berekeningen --- Machine theory --- Machines [Théorie des ] --- Mathematical machine theory --- Théorie des automates mathématiques --- Théorie des machines --- Wiskundige automaten [Theorie van de ] --- Machine theory. --- Thermodynamics --- Computational complexity. --- #TELE:SISTA --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing
Choose an application
Computer science --- Computers [Electronic digital ] --- Computers [Electronische digitale ] --- Elektronische digitale computers --- Ordinateurs numériques électroniques --- Formal languages. --- Langages formels. --- Automates mathématiques, Théorie des. --- Machine theory. --- Computational complexity. --- Complexité de calcul (informatique) --- Electronic data processing --- Electronic digital computers --- Automates mathématiques, Théorie des. --- Complexité de calcul (informatique)
Choose an application
Computer. Automation --- Automates conscients --- Bewuste automaten --- Bio-senseurs --- Bio-sensoren --- Biomedical detectors --- Biomedical sensors --- Biosensors --- Conscious automata --- Detectors [Biomedical ] --- Electronica [Moleculaire ] --- Electronics [Molecular ] --- Electronique moléculaire --- Moleculaire elektronica --- Molecular electronics --- Sensors [Biomedical ] --- Molecular electronics. --- Biosensors. --- Conscious automata.
Choose an application
Automates cellulaires --- Cellulaire automaten --- Cellular automata --- Cellular automata. --- 519.713 --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Automata --- 519.713 Automata
Choose an application
The main idea behind the series of volumes Advances in Petri Nets is to present to the general computer science community recent results which are the most representative and significant for the development of the area. Thepapers for the volumes are drawn mainly from the annual International Conferences on Applications and Theory of Petri Nets. Selected papers from the latest conference are independently refereed, and revised and extended as necessary. Some further papers submitted directly to the editor are included. Advances in Petri Nets 1991 covers the 11th International Conference on Applications and Theory of Petri Nets held in Paris, France in June 1991. The volume contains the Bibliography of Petri Nets 1990 prepared by H. Pl}nnecke and W. Reisig, with over 4000 entries.
Computer architecture. Operating systems --- Petri nets --- Machine theory --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congresses --- Congrès --- Réseaux de Pétri --- Automates mathématiques, Théorie des --- Congrès --- Computer science. --- Computer Communication Networks. --- Mathematics. --- Computer software. --- Logic design. --- Computation by Abstract Devices. --- Applications of Mathematics. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Processor Architectures. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Software, Computer --- Computer systems --- Math --- Science --- Informatics
Choose an application
CONCUR'91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR'90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selected for presentation at the conference (from 71 submitted) together with four invited papers and abstracts of the other invited papers. The papers are organized into sections on process algebras, logics and model checking, applications and specification languages, models and net theory, design and real-time, tools and probabilities, and programming languages. The proceedings of CONCUR'90 are available asVolume 458 of Lecture Notes in Computer Science.
Machine theory --- Parallel processing (Electronic computers) --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Congresses. --- Congrès --- 681.3*D13 --- Concurrent programming --- 681.3*D13 Concurrent programming --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Congrès --- Congresses --- Parallel processing (Electronic computers) - Congresses. --- Information theory. --- Computer science. --- Logic design. --- Theory of Computation. --- Computation by Abstract Devices. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics
Choose an application
This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.
Machine theory --- Automates mathématiques, Théorie des --- Congresses --- Congrès --- 681.3*D1 --- 681.3*E1 --- 681.3*F11 --- 681.3*I23 --- 681.3*I35 --- Programming techniques--See also {681.3*E} --- Data structures: arrays; graphs; lists; tables; trees --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Computational geometry and object modeling (Computer graphics) --- 681.3*I35 Computational geometry and object modeling (Computer graphics) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*E1 Data structures: arrays; graphs; lists; tables; trees --- 681.3*D1 Programming techniques--See also {681.3*E} --- Automates mathématiques, Théorie des --- Congrès --- Machine theory - Congresses. --- Information theory. --- Computer science. --- Data structures (Computer scienc. --- Combinatorics. --- Computer software. --- Artificial intelligence. --- Theory of Computation. --- Mathematical Logic and Formal Languages. --- Data Structures. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence. --- Software, Computer --- Computer systems --- Combinatorics --- Algebra --- Mathematical analysis --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers
Listing 1 - 9 of 9 |
Sort by
|