Buch, Englisch, Band 8587, 347 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 5445 g
19th International Conference, CIAA 2014, Giessen, Germany, July 30 -- August 2, 2014, Proceedings
Buch, Englisch, Band 8587, 347 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 5445 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-319-08845-7
Verlag: Springer International Publishing
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
FPsolve: A Generic Solver for Fixpoint Equations over Semirings.- Restarting Automata for Picture Languages: A Survey on Recent Developments.- Investigations on Automata and Languages over a Unary Alphabet.- Cellular Automata for Crowd Dynamics.- Counting Equivalent Linear Finite Transducers Using a Canonical Form.- On the Power of One-Way Automata with Quantum and Classical States.- On Comparing Deterministic Finite Automata and the Shuffle of Words.- Minimal Partial Languages and Automata.- Large Aperiodic Semigroups.- On the Square of Regular Languages.- Unary Languages Recognized by Two-Way One-Counter Automata.- A Type System for Weighted Automata and Rational Expressions.- Bounded Prefix-Suffix Duplication.- Recognition of Labeled Multidigraphs by Spanning Tree Automata.- Reset Thresholds of Automata with Two Cycle Lengths.- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers.- Kleene Closure on Regular and Prefix-Free Languages.- Left is Better than Right for Reducing Nondeterminism of NFAs.- Analytic Functions Computable by Finite State Transducers.- Partial Derivative and Position Bisimilarity Automata.- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers.- Pushdown Machines for Weighted Context-Free Tree Translation.- Weighted Variable Automata over Infinite Alphabets.- Implications of Quantum Automata for Contextuality.- Pairwise Rational Kernels Obtained by Automaton Operations.
