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 : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil
| Descriptional complexity of formal systems : 24th IFIP WG 1. 02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings / / edited by Yo-Sub Han and György Vaszil |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (239 pages) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Formal methods (Computer science)
Computational complexity |
| ISBN | 3-031-13257-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996485664403316 |
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings / / edited by Yo-Sub Han, György Vaszil
| Descriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings / / edited by Yo-Sub Han, György Vaszil |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (239 pages) |
| Disciplina |
004.0151
005.131 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer engineering Computer networks Artificial intelligence Computer Science Logic and Foundations of Programming Computer Engineering and Networks Artificial Intelligence |
| ISBN |
9783031132575
3031132572 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages -- Ranking Binary Unlabelled Necklaces in Polynomial Time -- On the Power of Recursive Word-Functions without Concatenation -- Clusters of Repetition Roots Forming Prefix Chains -- Nearly k-Universal Words - Investigating a Part of Simon’s Congruence -- State Complexity of Binary Coded Regular Languages -- Reset Complexity and Completely Reachable Automata with Simple Idempotents -- On the Descriptional Complexity of the Direct Product of Finite Automata -- Operations on Subregular Languages and Nondeterministic State Complexity -- On Simon’s Congruence Closure of a String -- Approximate NFA Universality Motivated by Information Theory -- Lazy Regular Sensing -- State Complexity of Finite Partial Languages -- Yet Another Canonical Nondeterministic Automaton -- Union-Complexities of Kleene Plus Operation. |
| Record Nr. | UNINA-9910586630003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (210 pages) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer Science Logic and Foundations of Programming |
| ISBN | 3-030-93489-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata. |
| Record Nr. | UNISA-996464397103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko
| Descriptional Complexity of Formal Systems : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / / edited by Yo-Sub Han, Sang-Ki Ko |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (210 pages) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer Science Logic and Foundations of Programming Informàtica |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-93489-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata. |
| Record Nr. | UNINA-9910520061803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / / edited by Yo-Sub Han, Kai Salomaa
| Implementation and Application of Automata [[electronic resource] ] : 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / / edited by Yo-Sub Han, Kai Salomaa |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 335 p. 91 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-319-40946-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Decision Problems for Finite Automata over Infinite Algebraic Structures -- The Degree of Irreversibility in Deterministic Finite Automata -- Deterministic Stack Transducers -- Computing the Expected Edit Distance from a String to a PFA -- Derived-Term Automata of Multitape Rational Expressions -- Solving Parity Games Using an Automata-Based Algorithm -- Ternary Equational Languages -- Problems on Finite Automata and the Exponential Time Hypothesis -- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata -- A Practical Simulation Result for Two-Way Pushdown Automata -- Nondeterministic Complexity of Operations on Closed and Ideal Languages -- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by Prefix-Free Languages -- A Logical Characterization of Small 2NFAs -- Experiments with Synchronizing Automata -- Implementation of Code Properties via Transducers -- On Synchronizing Automata and Uniform Distribution -- Looking for the Pairs that are Hard to Separate: A Quantum Approach -- Prefix Distance Between Regular Languages -- Complexity of Sets of Two-Dimensional Patterns -- The Complexity of Fixed-Height Patterned Tile Self-Assembly -- Derivative-Based Diagnosis of Regular Expression Ambiguity -- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages -- Derivatives for Enhanced Regular Expressions -- Weighted Restarting Automata as Language Acceptors -- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy -- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA. |
| Record Nr. | UNISA-996465959603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / / edited by Yo-Sub Han, Kai Salomaa
| Implementation and Application of Automata : 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings / / edited by Yo-Sub Han, Kai Salomaa |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 335 p. 91 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Artificial intelligence - Data processing Computer science - Mathematics Discrete mathematics Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-319-40946-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Decision Problems for Finite Automata over Infinite Algebraic Structures -- The Degree of Irreversibility in Deterministic Finite Automata -- Deterministic Stack Transducers -- Computing the Expected Edit Distance from a String to a PFA -- Derived-Term Automata of Multitape Rational Expressions -- Solving Parity Games Using an Automata-Based Algorithm -- Ternary Equational Languages -- Problems on Finite Automata and the Exponential Time Hypothesis -- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata -- A Practical Simulation Result for Two-Way Pushdown Automata -- Nondeterministic Complexity of Operations on Closed and Ideal Languages -- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L -- Kuratowski Algebras Generated by Prefix-Free Languages -- A Logical Characterization of Small 2NFAs -- Experiments withSynchronizing Automata -- Implementation of Code Properties via Transducers -- On Synchronizing Automata and Uniform Distribution -- Looking for the Pairs that are Hard to Separate: A Quantum Approach -- Prefix Distance Between Regular Languages -- Complexity of Sets of Two-Dimensional Patterns -- The Complexity of Fixed-Height Patterned Tile Self-Assembly -- Derivative-Based Diagnosis of Regular Expression Ambiguity -- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages -- Derivatives for Enhanced Regular Expressions -- Weighted Restarting Automata as Language Acceptors -- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy -- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA. |
| Record Nr. | UNINA-9910484863403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||