My Account Log in

1 option

Implementation and Application of Automata : 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings / edited by Michal Hospodár, Galina Jirásková.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Hospodár, Michal., Editor.
Jirásková, Galina, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11601
Theoretical Computer Science and General Issues, 2512-2029 ; 11601
Language:
English
Subjects (All):
Computer science.
Artificial intelligence.
Computer engineering.
Computer networks.
Software engineering.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Computer Engineering and Networks.
Software Engineering.
Local Subjects:
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Computer Engineering and Networks.
Software Engineering.
Physical Description:
1 online resource (XVI, 249 pages) : 440 illustrations, 25 illustrations in color.
Edition:
1st ed. 2019.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2019.
System Details:
text file PDF
Summary:
This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams.
Contents:
Static Garbage Collection
Graph-Walking Automata: From Whence They Come, and Whither They Are Bound
Enumerated Automata Implementation of String Dictionaries
New Approaches for Context Sensitive Flash Codes
Dolev-Yao Theory with Associative Blindpair Operators: An Automata-Theoretic Approach
Semi-Linear Lattices and Right One-Way Jumping Finite Automata
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
A Benchmark Production Tool for Regular Expressions
New Algorithms for Manipulating Sequence BDDs
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata
Descriptional Complexity of Power and Positive Closure on Convex Languages
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels
Input-Driven Multi-Counter Automata
Two-Dimensional Pattern Matching against Basic Picture Languages
Decision Problems for Restricted Variants of Two-Dimensional Automata
Streaming Ranked-Tree-to-String Transducers. .
Other Format:
Printed edition:
ISBN:
978-3-030-23679-3
9783030236793
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account