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.
Data Science [[electronic resource] ] : 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings / / edited by Sebastian Maneth
| Data Science [[electronic resource] ] : 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings / / edited by Sebastian Maneth |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XX, 221 p. 84 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Database management
Information storage and retrieval Application software Data structures (Computer science) Software engineering Database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Data Structures Data Storage Representation Software Engineering |
| ISBN | 3-319-20424-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996198515703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Data Science : 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings / / edited by Sebastian Maneth
| Data Science : 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings / / edited by Sebastian Maneth |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XX, 221 p. 84 illus.) |
| Disciplina | 005.74 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Database management
Information storage and retrieval Application software Data structures (Computer science) Software engineering Database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Data Structures Data Storage Representation Software Engineering |
| ISBN | 3-319-20424-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484425203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / / edited by Sebastian Maneth
| Implementation and Application of Automata [[electronic resource] ] : 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / / edited by Sebastian Maneth |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (202 pages) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer engineering Computer networks Logic programming Theory of Computation Computer Engineering and Networks Logic in AI |
| ISBN | 3-030-79121-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polyregular Functions -- Back to the Future: A Fresh Look at Linear Temporal Logic -- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages -- Memoized Regular Expressions -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis -- Degrees of Restriction for Two-Dimensional Automata -- The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract) -- Guessing the Buffer Bound for k-Synchronizability -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers -- Ambiguity Hierarchies for Weighted Tree Automata -- Boolean Kernels of Context-Free Languages -- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton -- Approximate Hashing for Bioinformatics. |
| Record Nr. | UNISA-996464502503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / / edited by Sebastian Maneth
| Implementation and Application of Automata : 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings / / edited by Sebastian Maneth |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (202 pages) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer engineering Computer networks Logic programming Theory of Computation Computer Engineering and Networks Logic in AI |
| ISBN | 3-030-79121-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polyregular Functions -- Back to the Future: A Fresh Look at Linear Temporal Logic -- Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs 15 Jeffrey Shallit Technical Contributions Regularity Conditions for Iterated Shuffle on Commutative Regular Languages -- Memoized Regular Expressions -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis -- Degrees of Restriction for Two-Dimensional Automata -- The Range of State Complexities of Languages Resulting from the Cascade Product—The Unary Case (Extended Abstract) -- Guessing the Buffer Bound for k-Synchronizability -- The Commutative Closure of Shuffle Languages over Group Languages is Regular -- Organization IX Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers -- Ambiguity Hierarchies for Weighted Tree Automata -- Boolean Kernels of Context-Free Languages -- Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton -- Approximate Hashing for Bioinformatics. |
| Record Nr. | UNINA-9910488705603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings / / edited by Sebastian Maneth
| Implementation and Application of Automata [[electronic resource] ] : 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings / / edited by Sebastian Maneth |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 263 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science Algorithms Machine theory Electronic digital computers—Evaluation Programming Techniques Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory System Performance and Evaluation |
| ISBN |
1-282-29795-3
9786612297953 3-642-02979-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Implementation and Application of Automata in String Processing -- Applications of Automata in XML Processing -- Program Analysis through Finite Tree Automata -- Technical Contributions -- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton -- On Extremal Cases of Hopcroft’s Algorithm -- Compact Normal Form for Regular Languages as Xor Automata -- Cellular Automata with Sparse Communication -- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule -- On Parallel Implementations of Deterministic Finite Automata -- FAdo and GUItar -- A Testing Framework for Finite-State Morphology -- A Table Compression Method for Extended Aho-Corasick Automaton -- Compact Representation for Answer Sets of n-ary Regular Queries -- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata -- Random Generation of Deterministic Tree (Walking) Automata -- Hedge Pattern Partial Derivative -- TAGED Approximations for Temporal Properties Model-Checking -- Verifying Parallel Programs with Dynamic Communication Structures -- Fixpoint Guided Abstraction Refinement for Alternating Automata -- Automata-Based Termination Proofs -- Implementation of State Elimination Using Heuristics -- Short Regular Expressions from Finite Automata: Empirical Results -- Small Extended Expressions for Acyclic Automata -- Quantum Queries on Permutations with a Promise -- Time-Optimal Winning Strategies for Poset Games -- Amount of Nonconstructivity in Finite Automata -- Short Papers and Poster Abstracts -- Multiflex: A Multilingual Finite-State Tool for Multi-Word Units -- Efficient Parsing Using Filtered-Popping Recursive Transition Networks -- Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms -- Formally Synthesising a Protocol Converter: A Case Study -- Compiler Generator Based on Restarting Automata -- Are Statecharts Finite Automata?. |
| Record Nr. | UNISA-996465850303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and application of automata : 14th international conference, CIAA 2009, Sydney, Australia, July 14-17, 2009 : proceedings / / Sebastian Maneth (ed.)
| Implementation and application of automata : 14th international conference, CIAA 2009, Sydney, Australia, July 14-17, 2009 : proceedings / / Sebastian Maneth (ed.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XI, 263 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) | ManethSebastian |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Machine theory |
| ISBN |
1-282-29795-3
9786612297953 3-642-02979-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Implementation and Application of Automata in String Processing -- Applications of Automata in XML Processing -- Program Analysis through Finite Tree Automata -- Technical Contributions -- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton -- On Extremal Cases of Hopcroft’s Algorithm -- Compact Normal Form for Regular Languages as Xor Automata -- Cellular Automata with Sparse Communication -- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule -- On Parallel Implementations of Deterministic Finite Automata -- FAdo and GUItar -- A Testing Framework for Finite-State Morphology -- A Table Compression Method for Extended Aho-Corasick Automaton -- Compact Representation for Answer Sets of n-ary Regular Queries -- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata -- Random Generation of Deterministic Tree (Walking) Automata -- Hedge Pattern Partial Derivative -- TAGED Approximations for Temporal Properties Model-Checking -- Verifying Parallel Programs with Dynamic Communication Structures -- Fixpoint Guided Abstraction Refinement for Alternating Automata -- Automata-Based Termination Proofs -- Implementation of State Elimination Using Heuristics -- Short Regular Expressions from Finite Automata: Empirical Results -- Small Extended Expressions for Acyclic Automata -- Quantum Queries on Permutations with a Promise -- Time-Optimal Winning Strategies for Poset Games -- Amount of Nonconstructivity in Finite Automata -- Short Papers and Poster Abstracts -- Multiflex: A Multilingual Finite-State Tool for Multi-Word Units -- Efficient Parsing Using Filtered-Popping Recursive Transition Networks -- Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms -- Formally Synthesising a Protocol Converter: A Case Study -- Compiler Generator Based on Restarting Automata -- Are Statecharts Finite Automata?. |
| Altri titoli varianti | CIAA 2009 |
| Record Nr. | UNINA-9910483253003321 |
| Berlin, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||