Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers

Computer science --- Machine theory --- Parallel processing (Electronic computers) --- Automates mathématiques, Théorie des --- Parallélisme (Informatique) --- Machine theory. --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"The algebraic theory of automata was created by Schutzenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas such as representation theory, combinatorial mathematics and theoretical computer science. This book presents to an audience of graduate students and researchers a modern account of the subject and its applications. The algebraic approach allows the theory to be developed in a general form of wide applicability. For example, number-theoretic results can now be more fully explored, in addition to applications in automata theory, codes and non-commutative algebra. Much material, for example, Schutzenberger's theorem on polynomially bounded rational series, appears here for the first time in book form. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap"--

Machine theory --- Noncommutative algebras --- Automates mathématiques, Théorie des --- Algèbres non commutatives --- Automates mathématiques, Théorie des --- Algèbres non commutatives --- Machine theory. --- Noncommutative algebras. --- Automates. --- Algèbres non commutatives. --- Algebras, Noncommutative --- Non-commutative algebras --- Algebra --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Algèbres non commutatives.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book describes how model selection and statistical inference can be founded on the shortest code length for the observed data, called the stochastic complexity. This generalization of the algorithmic complexity not only offers an objective view of statistics, where no prejudiced assumptions of ""true"" data generating distributions are needed, but it also in one stroke leads to calculable expressions in a range of situations of practical interest and links very closely with mainstream statistical theory. The search for the smallest stochastic complexity extends the classical maximum likel

Machine theory. --- Computational complexity. --- Stochastic processes. --- Random processes --- Probabilities --- Complexity, Computational --- Electronic data processing --- Machine theory --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Computational complexity --- Stochastic processes --- Complexité de calcul (Informatique) --- Automates mathématiques, Théorie des --- Processus stochastiques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Electronic digital computers --- Machine theory --- System analysis --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Ordinateurs --- Automates mathématiques, Théorie des --- Systèmes, Analyse de --- Electronic digital computers. --- Machine theory. --- System analysis. --- Computermethoden. --- Systeemtheorie. --- Computing --- Network theory --- Systems analysis --- System theory --- Mathematical optimization --- Automatic digital computers --- Computers, Electronic digital --- Digital computers, Electronic --- Computers --- Hybrid computers --- Sequential machine theory --- Network analysis --- Network science

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between the three domains of the title. Developing them was the main purpose of the NATO ASI summerschool held in Montreal in 2003. Although some connections, for example between semigroups and automata, were known for a long time, developing them and surveying them in one volume is novel and hopefully stimulating for the future. Another aspect is the emphasis on the structural theory of automata that studies ways to construct big automata from small ones. The volume also has contributions on top current research or surveys in the three domains. One contribution even links clones of universal algebra with the computational complexity of computer science. Three contributions introduce the reader to research in the former East block.

Abstract automata --- Abstract machines --- Algebra [Multiple ] --- Algebra [Universal ] --- Algebra [Universele ] --- Algèbre universelle --- Automata --- Automates [Théorie des ] --- Automates mathématiques [Théorie des ] --- Machine theory --- Machines [Théorie des ] --- Mathematical machine theory --- N-way algebra --- Semigroup algebras --- Théorie des automates mathématiques --- Théorie des machines --- Universal algebra --- Universele algebra --- Wiskundige automaten [Theorie van de ] --- Algebra, Universal. --- Semigroup algebras. --- Machine theory. --- Algèbres de semi-groupes --- Automates mathématiques, Théorie des --- Algebra, Universal --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Algèbre universelle --- Algèbres de semi-groupes --- Automates mathématiques, Théorie des --- EPUB-LIV-FT LIVMATHE SPRINGER-B --- Algebras, Semigroup --- Algebra, Multiple --- Multiple algebra --- Mathematics. --- Algebra. --- Group theory. --- General Algebraic Systems. --- Group Theory and Generalizations. --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Algebra, Abstract --- Numbers, Complex --- Groups, Theory of --- Substitutions (Mathematics) --- Mathematical analysis --- Structural theory