| Description |
1 online resource (xxiii, 316 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 9223 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 9223. 1611-3349
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Intro; Preface; Organization; Invited Papers; Automata and Logics for Concurrent Systems:Five Models in Five Pages; Resource Automatic Structures for Verificationof Boundedness Properties; Finite-State Technologyin Natural Language Processing; Hardware Implementationsof Finite Automata and Regular Expressions; Contents; Invited Papers; Automata and Logics for Concurrent Systems: Five Models in Five Pages; 1 Introduction; 2 Finite Automata; 3 Class Memory Automata; 4 Nested-Word Automata; 5 Asynchronous Automata; 6 Message-Passing Automata; 7 Conclusion; References |
|
Hardware Implementations of Finite Automata and Regular Expressions1 Introduction; 2 Typical Solutions; 2.1 Abstractions; 2.2 Implementations; 2.3 Gaps in Current Solutions; 3 New Implementations; 4 Ongoing and Future Work; References; Regular Papers; Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems; 1 Introduction; 1.1 Motivation; 1.2 Problems Considered and Summary of Results; 1.3 Related Work; 2 Definitions and Problem Formulation; 2.1 Formal Definition of the SyDS Model; 2.2 Additional Terminology and Notation; 2.3 Problem Formulations |
|
2.4 Preliminary Results3 Threshold Inference from Homogeneous Behavior Specifications; 3.1 Inferring Thresholds from Stable Configurations; 3.2 Inferring Thresholds from Unstable Configurations; 4 Inference from Heterogeneous Collections of Behavior; 4.1 The Complexity of ITSUC; 4.2 Fixed Parameter Tractability of ITSUC; 5 Future Research Directions; References; From Ambiguous Regular Expressions to Deterministic Parsing Automata; 1 Introduction; 2 Basic Definitions; 3 Parser Construction; 4 Tree and Complexity; 5 Disambiguation Criteria; 6 Conclusion; References |
|
Deciding Synchronous Kleene Algebra with Derivatives1 Introduction; 2 Deciding Synchronous Kleene Algebra; 2.1 Partial Derivative Automata for SKA; 2.2 Equivalence of SKA Expressions; 2.3 Implementation and Experimental Results; 3 Deciding Synchronous Kleene Algebra with Tests; 3.1 SKAT and Guarded Synchronous Strings; 3.2 Automata for Guarded Synchronous Strings; 3.3 Partial Derivatives for SKAT; 4 Experimental Results; 5 Conclusion; References; On the Hierarchy of Block Deterministic Languages; 1 Introduction; 2 Preliminaries; 2.1 Languages and Automata Basics |
|
2.2 One-Unambiguous Regular Languages2.3 Block Deterministic Regular Languages; 3 Previous Results on Block-Deterministic Languages; 4 A Witness for the Infinite Hierarchy; References; Security of Numerical Sensors in Automata; 1 Introduction; 2 Preliminaries; 3 Maximal Mutual Information; 4 Secure Numerical Sensing in Automata; 4.1 Secure Numerical Sensing w.r.t. Estimated Mutual Information Rate; 4.2 Secure Numerical Sensing in Automata; 5 Conclusions; References; Jumping Finite Automata: Characterizations and Complexity; 1 Introduction; 2 Operations on Languages and Their Properties |
| Summary |
This book constitutes the refereed proceedings of the 20th International Conference on Implementation and Application of Automata, CIAA 2015, held in held in Umeå, Sweden, in August 2015. The 22 revised full papers presented together with 4 invited papers and 2 toool demonstration papers were carefully reviewed and selected from 49 submissions. The papers cover all aspects of cover automata, counter automata, decision algorithms on automata, descriptional complexity, expressive power of automata, homing sequences, jumping finite automata, multi-dimensional languages, parsing and pattern matching, quantum automata, realtime pushdown automata, random generation of automata, regular expressions, security issues, sensors in automata, transducers, transformation of automata, and weighted automata |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
bioinformatics |
|
computational science |
|
algoritmen |
|
algorithms |
|
computeranalyse |
|
computer analysis |
|
informatieontsluiting |
|
information retrieval |
|
informatieopslag |
|
information storage |
|
gegevensstructuren |
|
data structures |
|
wiskunde |
|
mathematics |
|
logica |
|
logic |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Notes |
Includes author index |
|
International conference proceedings |
| Subject |
Machine theory -- Congresses
|
|
Robotics -- Congresses
|
|
Algorithms & data structures.
|
|
Mathematical theory of computation.
|
|
Life sciences: general issues.
|
|
Information retrieval.
|
|
User interface design & usability.
|
|
Computers -- Programming -- Algorithms.
|
|
Mathematics -- Logic.
|
|
Computers -- Computer Science.
|
|
Computers -- Data Modeling & Design.
|
|
Computers -- System Administration -- Storage & Retrieval.
|
|
Computers -- Machine Theory.
|
|
Machine theory
|
|
Robotics
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Drewes, Frank, editor.
|
| ISBN |
9783319223605 |
|
3319223607 |
|
