Martin Kutrib

Markus Holzer

This book constitutes the refereed proceedings of the 19th International Conference on Implementation and Application of Automata, CIAA 2014, held in Giessen, Germany, in July/August 2014. The 21 revised full papers presented together with 4 invited papers were carefully selected from 36 submissions. The papers cover all aspects of implementation, application, and theory of automata and related structures such as algorithms on automata, automata and logic, bioinformatics, complexity of automata operations, compilers, computer-aided verification, concurrency, data structure design for automata, data and image compression, design and architecture of automata software, digital libraries, DNA/molecular/membrane computing, document engineering, editors, environments, experimental studies and practical experience, implementation of verification methods and model checking, industrial applications, natural language and speech processing, networking, new algorithms for manipulating automata, object-oriented modeling, pattern-matching, pushdown automata and context-free grammars, quantum computing, structured and semi-structured documents, symbolic manipulation environments for automata, transducers and multi-tape automata, techniques for graphical display of automata, VLSI, viruses and related phenomena, and world-wide Web.

19th International Conference, CIAA 2014, Giessen, Germany, July 30 -- August 2, 2014, Proceedings

Implementation and Application of Automata

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 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; Kolmogorov complexity.

Markus Holzer

Books

Your next favorite book is out there