Descriptional Complexity of Formal Systems [[electronic resource] ] : 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings / / edited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (X, 299 p. 230 illus., 5 illus. in color.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Artificial intelligence Database management Computers, Special purpose Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Database Management Special Purpose and Application-Based Systems |
ISBN | 3-030-23247-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory. . |
Record Nr. | UNISA-996466349203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Descriptional Complexity of Formal Systems : 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings / / edited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (X, 299 p. 230 illus., 5 illus. in color.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Artificial intelligence Database management Computers, Special purpose Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Database Management Special Purpose and Application-Based Systems |
ISBN | 3-030-23247-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory. . |
Record Nr. | UNINA-9910349315303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Implementation and Application of Automata [[electronic resource] ] : 24th International Conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019, Proceedings / / edited by Michal Hospodár, Galina Jirásková |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XVI, 249 p. 440 illus., 25 illus. in color.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
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 |
ISBN | 3-030-23679-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. . |
Record Nr. | UNISA-996466351103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
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á |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XVI, 249 p. 440 illus., 25 illus. in color.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
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 |
ISBN | 3-030-23679-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. . |
Record Nr. | UNINA-9910349315003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|