Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
This book constitutes the refereed proceedings of the 16th International Conference on Developments in Language Theory, DLT 2012, held in Taipei, Taiwan, in August 2012. The 34 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or extended abstracts of 4 invited lectures, as well as a special memorial presentation in honor of Sheng Yu. The topics covered include grammars, acceptors and transducers for words, trees and graphs, algebraic theories of automata, algorithmic, combinatorial and algebraic properties of words and languages; variable length codes, symbolic dynamics, cellular automata, polyominoes and multidimensional patterns, decidability questions, image manipulation and compression, efficient text algorithms, relationships to cryptography, concurrency, complexity theory and logic, bio-inspired computing, quantum computing.

Abstrak :
This festschrift volume, published in honor of Jürgen Dassow on the occasion of his 65th birthday, contains 19 contributions by leading researchers, colleagues, and friends. Covering topics on picture languages, cooperating distributed systems of automata, quantum automata, grammar systems, online computation, word equations, biologically motivated formal systems, controlled derivations, descriptional complexity, as well as 'classical' topics of automata and language theory, the articles presented span the range of the scientific work of Jürgen Dassow.

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 easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction, but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features : teaches finite math as a language for thinking, as much as knowledge and skills to be acquired, uses an intuitive approach with a focus on examples for all general concepts, brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction, balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives, includes highlight boxes that raise common queries and clear confusions, and provides numerous exercises, with selected solutions.

Abstrak :
This book constitutes the refereed proceedings of the 15th and 16th International Conference on Formal Grammar 2010 and 2011,collocated with the European Summer School in Logic, Language and Information in July 2010/2011. The 19 revised full papers were carefully reviewed and selected from a total of 50 submissions. The papers papers deal with the following topics: formal and computational phonology, morphology, syntax, semantics and pragmatics, model-theoretic and proof-theoretic methods in linguistics, logical aspects of linguistic structure, constraint-based and resource-sensitive approaches to grammar, learnability of formal grammar, integration of stochastic and symbolic models of grammar, foundational, methodological and architectural issues in grammar, and mathematical foundations of statistical approaches to linguistic analysis.

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.