Ito Masami Ito – författare
Visar alla böcker från författaren Ito Masami Ito. Handla med fri frakt och snabb leverans.
8 produkter
8 produkter
E-bok
PDF, Engelska, 2010501 kr
Läs direkt efter köp
This volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner bases, minimal clones, zero-divisor graphs, fine convergence of functions, and others.
E-bok
PDF, Engelska, 20031 484 kr
Läs direkt efter köp
The research results published in this book range from pure mathematical theory (semigroup theory, discrete mathematics, etc.) to theoretical computer science, in particular formal languages and automata. The papers address issues in the algebraic and combinatorial theories of semigroups, words and languages, the structure theory of automata, the classification theory of formal languages and codes, and applications of these theories to various areas, like quantum and molecular computing, coding theory, and cryptography.
E-bok
PDF, Engelska, 2001697 kr
Läs direkt efter köp
This is an excellent collection of papers dealing with combinatorics on words, codes, semigroups, automata, languages, molecular computing, transducers, logics, etc., related to the impressive work of Gabriel Thierrin. This volume is in honor of Professor Thierrin on the occasion of his 80th birthday.
E-bok
PDF, Engelska, 2004544 kr
Läs direkt efter köp
Although there are some books dealing with algebraic theory of automata, their contents consist mainly of Krohn-Rhodes theory and related topics. The topics in the present book are rather different. For example, automorphism groups of automata and the partially ordered sets of automata are systematically discussed. Moreover, some operations on languages and special classes of regular languages associated with deterministic and nondeterministic directable automata are dealt with. The book is self-contained and hence does not require any knowledge of automata and formal languages.
E-bok
PDF, Engelska, 2005917 kr
Läs direkt efter köp
This volume presents research results ranging from those in pure mathematical theory (semigroup theory, graph theory, etc.) to those in theoretical and applied computer science, e.g. formal languages, automata, codes, parallel and distributed computing, formal systems, knowledge systems and database theory.
E-bok
PDF, Engelska, 19991 128 kr
Läs direkt efter köp
There is algebraic structure in time, computation and biological systems. Algebraic engineering exploits this structure to achieve better understanding and design. In this book, pure and applied results in semigroups, language theory and algebra are applied to areas ranging from circuit design to software engineering to biological evolution.
E-bok
PDF, Engelska, 1992683 kr
Läs direkt efter köp
The topics included in this proceedings cover both mathematics and computer science. They include Codes, Free Monoids, Transformation Semigroups, Automata, Formal Languages, Word Problems, Orders and Combinatorics. Attention is paid to the algebraic theories of codes and rewriting systems, which are the key subjects that combine these two fields. The number of papers in the proceedings exceeds 45 and all papers have been refereed.
E-bok
Engelska, 2014737 kr
Läs direkt efter köp
A word is said to be primitive if it cannot be represented as any power of another word. It is a well-known conjecture that the set of all primitive words Q over a non-trivial alphabet is not context-free: this conjecture is still open. In this book, the authors deal with properties of primitive words over a non-primitive alphabet, the language consisting of all primitive words and related languages. Moreover, some decidable and undecidable problems with respect to the above languages are discussed as well. As another try, a search for a non-phrase structure grammar which generates Q is performed.