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
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
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
|
| Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Edizione: | 1st ed. 2019. |
| Descrizione fisica: | 1 online resource (X, 299 p. 230 illus., 5 illus. in color.) |
| Disciplina: | 005.1015113 |
| 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 | |
| Persona (resp. second.): | HospodárMichal |
| JiráskováGalina | |
| KonstantinidisStavros | |
| Nota di bibliografia: | Includes bibliographical references and index. |
| 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. . |
| Sommario/riassunto: | This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019. The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. . |
| Titolo autorizzato: | Descriptional Complexity of Formal Systems |
| ISBN: | 3-030-23247-6 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466349203316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 11612