Descriptional Complexity of Formal Systems 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings /

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Hospodár, Michal (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jirásková, Galina (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Konstantinidis, Stavros (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
Έκδοση:1st ed. 2019.
Σειρά:Theoretical Computer Science and General Issues ; 11612
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04643nam a2200601 4500
001 978-3-030-23247-4
003 DE-He213
005 20191024071749.0
007 cr nn 008mamaa
008 190625s2019 gw | s |||| 0|eng d
020 |a 9783030232474  |9 978-3-030-23247-4 
024 7 |a 10.1007/978-3-030-23247-4  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.L63 
050 4 |a QA76.5913 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
072 7 |a UYF  |2 thema 
082 0 4 |a 005.1015113  |2 23 
245 1 0 |a Descriptional Complexity of Formal Systems  |h [electronic resource] :  |b 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings /  |c edited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis. 
250 |a 1st ed. 2019. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2019. 
300 |a X, 299 p. 230 illus., 5 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 11612 
505 0 |a 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. . 
520 |a 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. . 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 0 |a Database management. 
650 0 |a Special purpose computers. 
650 1 4 |a Logics and Meanings of Programs.  |0 http://scigraph.springernature.com/things/product-market-codes/I1603X 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 http://scigraph.springernature.com/things/product-market-codes/I16048 
650 2 4 |a Artificial Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/I21000 
650 2 4 |a Database Management.  |0 http://scigraph.springernature.com/things/product-market-codes/I18024 
650 2 4 |a Special Purpose and Application-Based Systems.  |0 http://scigraph.springernature.com/things/product-market-codes/I13030 
700 1 |a Hospodár, Michal.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Jirásková, Galina.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Konstantinidis, Stavros.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783030232467 
776 0 8 |i Printed edition:  |z 9783030232481 
830 0 |a Theoretical Computer Science and General Issues ;  |v 11612 
856 4 0 |u https://doi.org/10.1007/978-3-030-23247-4  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)