Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
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
| 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 | ||
| Materiale a stampa | ||
| 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
| 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 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings / / edited by Stavros Konstantinidis, Giovanni Pighizzini
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings / / edited by Stavros Konstantinidis, Giovanni Pighizzini |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 251 p. 35 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-94631-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. |
| Record Nr. | UNISA-996466438803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings / / edited by Stavros Konstantinidis, Giovanni Pighizzini
| Descriptional Complexity of Formal Systems : 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018, Proceedings / / edited by Stavros Konstantinidis, Giovanni Pighizzini |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 251 p. 35 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Natural language processing (Computer science) Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Science Logic and Foundations of Programming Natural Language Processing (NLP) Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-94631-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal languages and automata theory -- State complexity -- Grammars -- Randomness -- Automata extensions -- Algebraic language theory. |
| Record Nr. | UNINA-9910349421303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis
| Implementation and Application of Automata [[electronic resource] ] : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 358 p. 78 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Bioinformatics Artificial intelligence—Data processing Information storage and retrieval systems Theory of Computation Formal Languages and Automata Theory Computational and Systems Biology Data Science Information Storage and Retrieval |
| ISBN | 3-642-39274-1 |
| Classificazione |
004
DAT 500f DAT 550f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity of automata -- Compressed automata -- Counter automata -- Dictionary matching -- Edit distance -- Homing sequences -- Implementation -- Minimization of automata -- Model checking -- Parsing of regular expressions -- Partial word automata -- Picture languages -- Pushdown automata -- Queue automata -- Reachability analysis for software verification -- Restarting automata -- Transducers -- Tree automata -- Weighted automata -- XML streams. |
| Record Nr. | UNISA-996466242303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis
| Implementation and Application of Automata : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / / edited by Stavros Konstantinidis |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIV, 358 p. 78 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Bioinformatics Artificial intelligence—Data processing Information storage and retrieval systems Theory of Computation Formal Languages and Automata Theory Computational and Systems Biology Data Science Information Storage and Retrieval |
| ISBN | 3-642-39274-1 |
| Classificazione |
004
DAT 500f DAT 550f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity of automata -- Compressed automata -- Counter automata -- Dictionary matching -- Edit distance -- Homing sequences -- Implementation -- Minimization of automata -- Model checking -- Parsing of regular expressions -- Partial word automata -- Picture languages -- Pushdown automata -- Queue automata -- Reachability analysis for software verification -- Restarting automata -- Transducers -- Tree automata -- Weighted automata -- XML streams. |
| Record Nr. | UNINA-9910484900803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||