Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
The purpose of this book is to present an up to date account of fuzzy ideals of a semiring. The book concentrates on theoretical aspects and consists of eleven chapters including three invited chapters. Among the invited chapters, two are devoted to applications of Semirings to automata theory, and one deals with some generalizations of semirings.

Abstrak :
This book constitutes the thoroughly refereed papers of the 17th International Conference on Implementation and Application of Automata, CIAA 2012, held in Porto, Portugal, in July 2012. The 21 revised full papers presented together with 5 invited papers and 7 short papers were carefully selected from 53 submissions. The papers cover various topics such as automata applications in formal verification methods, natural language processing, pattern matching, data storage and retrieval, and bioinformatics, as well as theoretical work on automata theory.

Abstrak :
This book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012. The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism), trade-offs between computational models and/or operations, succinctness of description of (finite) objects, state explosion-like phenomena, circuit complexity of Boolean functions and related measures, resource-bounded or structure-bounded environments, frontiers between decidability and undecidability, universality and reversibility, structural complexity, formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages), nature-motivated (bio-inspired) architectures and unconventional models of computing, and Kolmogorov complexity.

Abstrak :
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes.

Abstrak :
This book constitutes the refereed proceedings of the 6th International Conference on Language and Automata Theory and Applications, LATA 2012, held in A Coruña, Spain in March 2012. The 41 revised full papers presented together with 3 invited talks and 2 invited tutorials were carefully reviewed and selected from 114 initial submissions. The volume features contributions from both classical theory fields and application areas; e.g. innformatics, systems biology, language technology, artificial intelligence, etc. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.

Abstrak :
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. The authors also investigate automata networks as products of automata, that is, as compositions of automata obtained by cascading without feedback or with feedback of various restricted types or, most generally, with the feedback dependencies controlled by an arbitrary directed graph. This self-contained book surveys and extends the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others.

Abstrak :
This book focuses on web service specification, search, composition, validation, resiliency, security and engineering, and discusses various service specification standards like WSDL, SAWSDL, WSMO and OWLS. The theory and associated algorithms for service specification verification are detailed using formal models like Petrinet, FSM and UML. The book also explores various approaches proposed for web service search and composition, highlighting input/output, parameter-based search, and selection of services based on both functional and non-functional parameters. In turn, it examines various types of composite web services and presents an overview of popular fault handling strategies for each of these types. Lastly, it discusses the standards used for implementing web service security on the basis of a case study, and introduces the Web Service Development Life Cycle (WSDLC), which defines co-operation between several industry partners to develop web services in a more structured way.

Abstrak :
This book contains the Proceedings of the Second International Symposium on the Education in Mechanism and Machine Science (ISEMMS 2017), which was held in Madrid, Spain. The Symposium has established a stable framework for exchanging experience among researchers regarding mechanism and machine science, with special emphasis on New Learning Technologies and globalization. The papers cover topics such as mechanism and machine science in mechanical engineering curricula; mechanism and machine science in engineering programs: methodology; mechanism and machine science in engineering programs: applications and research; and new trends in mechanical engineering education.