Choose an application
Automation theory and modeling of biological systems
Bionics. --- Biophysics. --- Models, Biological. --- Machine theory. --- Bionique --- Automates mathématiques, Théorie des --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Intellectronics --- Bioengineering --- Biophysics --- Cybernetics --- Simulation methods --- Systems engineering --- Automata theory
Choose an application
Electronic data processing --- Machine theory --- Information storage and retrieval systems --- Periodicals --- Informatique --- Automates mathématiques, Théorie des --- Systèmes d'information --- Périodiques. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics
Choose an application
Machine theory. --- Formal languages. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Formalization (Linguistics) --- Language and languages --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formal languages --- Computational complexity
Choose an application
Machine theory. --- Machine theory --- 519.713 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- 519.713 Automata --- Automates abstraits --- Algorithmique --- Automates finis --- Complexite
Choose an application
Ergodic theory. Information theory --- Number theory --- Machine theory --- Computational complexity --- Stochastic processes --- Random processes --- Probabilities --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing
Choose an application
Formal languages. --- Machine theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Formalization (Linguistics) --- Language and languages --- Machine theory --- Formal languages
Choose an application
This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In sum this is a comprehensive reference on the theory of variable-length codes and their relation to automata.
Machine theory --- Coding theory. --- Machine theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Signal theory (Telecommunication) --- Computer programming --- Machine theory - Problems, exercises, etc
Choose an application
Machine theory --- Recursion theory --- 510.5 --- Logic, Symbolic and mathematical --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics --- 510.5 Algorithms. Computable functions --- Algorithms. Computable functions --- Didactics of mathematics
Choose an application
Computational complexity --- Machine theory --- Stochastic processes --- Random processes --- Probabilities --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing --- Computer science --- Artificial intelligence. Robotics. Simulation. Graphics
Choose an application
Presents the English translation of Kaljulaid's 1979 Tartu/Minsk Candidate thesis. The thesis was devoted to representation theory in the spirit of his thesis advisor BI Plotkin. Through representation theory, Kaljulaid became also interested in automata theory, which at a later phase became his main area of interest.
Semigroups. --- Semigroup algebras. --- Machine theory. --- Mathematics --- Math --- Science --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Algebras, Semigroup --- Algebra --- Group theory --- History.