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] ] : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 311 p. 76 illus.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Software engineering Computer Science Logic and Foundations of Programming Theory of Computation Formal Languages and Automata Theory Software Engineering |
| ISBN | 3-319-60252-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sensing as a Complexity Measure -- Avoiding Overlaps in Pictures -- Descriptional Complexity and Operations - Two non-Classical Cases -- Applications of Transducers in Independent Languages, Word Distances, Codes -- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages -- On the Average Complexity of Strong Star Normal Form -- Most Complex Non-Returning Regular Languages -- Uncountable realtime probabilistic classes -- A Parametrized Analysis of Algorithms on Hierarchical Graphs -- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity -- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors -- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete -- Self-attraction removal from oritatami systems -- One-Time Nondeterministic Computations -- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages -- Branching Measures and Nearly Acyclic NFAs -- Square on Deterministic, Alternating, and Boolean Finite Automata -- A Pumping Lemma for Ordered Restarting Automata -- Concise Representations of Reversible Automata -- State Complexity of Unary SV-XNFA with Different Acceptance Conditions -- Reset Complexity of Ideal Languages Over a Binary Alphabet -- 2-state 2-symbol Turing machines with periodic support produce regular sets -- State Complexity of Suffix Distance -- The quotient operation on input-driven pushdown automata. |
| Record Nr. | UNISA-996466287303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu
| Descriptional Complexity of Formal Systems : 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings / / edited by Giovanni Pighizzini, Cezar Câmpeanu |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 311 p. 76 illus.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Software engineering Computer Science Logic and Foundations of Programming Theory of Computation Formal Languages and Automata Theory Software Engineering |
| ISBN | 3-319-60252-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sensing as a Complexity Measure -- Avoiding Overlaps in Pictures -- Descriptional Complexity and Operations - Two non-Classical Cases -- Applications of Transducers in Independent Languages, Word Distances, Codes -- On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages -- On the Average Complexity of Strong Star Normal Form -- Most Complex Non-Returning Regular Languages -- Uncountable realtime probabilistic classes -- A Parametrized Analysis of Algorithms on Hierarchical Graphs -- Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity -- Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors -- Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete -- Self-attraction removal from oritatami systems -- One-Time Nondeterministic Computations -- Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages -- Branching Measures and Nearly Acyclic NFAs -- Square on Deterministic, Alternating, and Boolean Finite Automata -- A Pumping Lemma for Ordered Restarting Automata -- Concise Representations of Reversible Automata -- State Complexity of Unary SV-XNFA with Different Acceptance Conditions -- Reset Complexity of Ideal Languages Over a Binary Alphabet -- 2-state 2-symbol Turing machines with periodic support produce regular sets -- State Complexity of Suffix Distance -- The quotient operation on input-driven pushdown automata. |
| Record Nr. | UNINA-9910483540803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 217 p. 50 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-319-41114-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuffle of Regular Languages -- MSO-definable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata. |
| Record Nr. | UNISA-996465824503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit
| Descriptional Complexity of Formal Systems : 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings / / edited by Cezar Câmpeanu, Florin Manea, Jeffrey Shallit |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 217 p. 50 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Algorithms Computer science—Mathematics Discrete mathematics Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-319-41114-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Completely Reachable Automata -- Words Avoiding Patterns, Enumeration Problems and the Chomsky Hierarchy -- Heapability, interactive particle systems, partial orders: results and open problems -- Self-Verifying Finite Automata and Descriptional Complexity -- On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection -- Unrestricted State Complexity of Binary Operations on Regular Languages -- On the State Complexity of the Shuffle of Regular Languages -- MSO-definable properties of Muller context-free languages are decidable -- Contextual Array Grammars with Matrix and Regular Control -- Descriptional Complexity of Graph-controlled Insertion-deletion Systems -- Operations on Weakly Recognizing Morphisms -- Descriptional Complexity of Bounded Regular Languages -- The Complexity of Languages Resulting from the Concatenation Operation -- Minimal and Reduced Reversible Automata. |
| Record Nr. | UNINA-9910484658103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings / / edited by Cezar Câmpeanu
| Implementation and Application of Automata [[electronic resource] ] : 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings / / edited by Cezar Câmpeanu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XI, 339 p. 65 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence—Data processing Information storage and retrieval systems Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Information Storage and Retrieval |
| ISBN | 3-319-94812-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | State complexity of automata -- Implementations of automata and experiments -- Enhanced regular expressions -- Complexity analysis. |
| Record Nr. | UNISA-996466207703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings / / edited by Cezar Câmpeanu
| Implementation and Application of Automata : 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings / / edited by Cezar Câmpeanu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XI, 339 p. 65 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence—Data processing Information storage and retrieval systems Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Information Storage and Retrieval |
| ISBN | 3-319-94812-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | State complexity of automata -- Implementations of automata and experiments -- Enhanced regular expressions -- Complexity analysis. |
| Record Nr. | UNINA-9910349419403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||