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] ] : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / / edited by Jeffrey Shallit, Alexander Okhotin
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / / edited by Jeffrey Shallit, Alexander Okhotin |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 293 p. 48 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-319-19225-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages. |
| Record Nr. | UNISA-996198526903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / / edited by Jeffrey Shallit, Alexander Okhotin
| Descriptional Complexity of Formal Systems : 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings / / edited by Jeffrey Shallit, Alexander Okhotin |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 293 p. 48 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-319-19225-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages. |
| Record Nr. | UNINA-9910483381803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Descriptional Complexity of Formal Systems [[electronic resource] ] : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
| Descriptional Complexity of Formal Systems [[electronic resource] ] : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 366 p. 59 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-319-09704-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of objects, state explosion-like phenomena -- Circuit complexity of Boolean functions and related measures -- Resource-bounded or structure-bounded environments -- Frontiers between decidability and undecidability -- Universality and reversibility -- Structural complexity -- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages) -- Nature-motivated (bio-inspired) architectures and unconventional models of computing -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. |
| Record Nr. | UNISA-996198266703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Descriptional Complexity of Formal Systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
| Descriptional Complexity of Formal Systems : 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings / / edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 366 p. 59 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-319-09704-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of objects, state explosion-like phenomena -- Circuit complexity of Boolean functions and related measures -- Resource-bounded or structure-bounded environments -- Frontiers between decidability and undecidability -- Universality and reversibility -- Structural complexity -- Formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages) -- Nature-motivated (bio-inspired) architectures and unconventional models of computing -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. |
| Record Nr. | UNINA-9910484146803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu
| Implementation and Application of Automata [[electronic resource] ] : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 336 p.) |
| Disciplina | 511.3/5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Computer science Machine theory Algorithms Artificial Intelligence Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-540-30500-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Automata-Theoretic Techniques for Analyzing Infinite-State Systems -- Enumerating Regular Expressions and Their Languages -- Contributed Papers -- A General Weighted Grammar Library -- On the Complexity of Hopcroft’s State Minimization Algorithm -- Implementation of Catalytic P Systems -- Code Selection by Tree Series Transducers -- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages -- Brute Force Determinization of NFAs by Means of State Covers -- Computing the Follow Automaton of an Expression -- Viral Gene Compression: Complexity and Verification -- Concatenation State Machines and Simple Functions -- FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views -- Finding Finite Automata That Certify Termination of String Rewriting -- Linear Encoding Scheme for Weighted Finite Automata -- The Generalization of Generalized Automata: Expression Automata -- An Automata Approach to Match Gapped Sequence Tags Against Protein Database -- State Complexity of Concatenation and Complementation of Regular Languages -- Minimal Unambiguous ?NFA -- Substitutions, Trajectories and Noisy Channels -- State Complexity and the Monoid of Transformations of a Finite Set -- An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract) -- Time and Space Efficient Algorithms for Constrained Sequence Alignment -- Stochastic Context-Free Graph Grammars for Glycoprotein Modelling -- Parametric Weighted Finite Automata for Figure Drawing -- Regional Finite-State Error Repair -- Approximating Dependency Grammars Through Intersection of Regular Languages -- On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata -- Poster Papers -- Tight Bounds for NFA to DFCA Transformations for Binary Alphabets -- Simulating the Process of Gene Assembly in Ciliates -- A BDD-Like Implementation of an Automata Package -- Approximation to the Smallest Regular Expression for a Given Regular Language -- Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory -- Does Hausdorff Dimension Measure Texture Complexity? -- Combining Regular Expressions with (Near-)Optimal Brzozowski Automata -- From Automata to Semilinear Sets: A Logical Solution for Sets ( , ) -- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids -- Minimalizations of NFA Using the Universal Automaton -- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata -- Size Reduction of Multitape Automata -- Testability of Oracle Automata -- Magic Numbers for Symmetric Difference NFAs. |
| Record Nr. | UNISA-996466028303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu
| Implementation and Application of Automata : 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers / / edited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 336 p.) |
| Disciplina | 511.3/5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Computer science Machine theory Algorithms Artificial Intelligence Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-540-30500-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Automata-Theoretic Techniques for Analyzing Infinite-State Systems -- Enumerating Regular Expressions and Their Languages -- Contributed Papers -- A General Weighted Grammar Library -- On the Complexity of Hopcroft’s State Minimization Algorithm -- Implementation of Catalytic P Systems -- Code Selection by Tree Series Transducers -- Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages -- Brute Force Determinization of NFAs by Means of State Covers -- Computing the Follow Automaton of an Expression -- Viral Gene Compression: Complexity and Verification -- Concatenation State Machines and Simple Functions -- FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views -- Finding Finite Automata That Certify Termination of String Rewriting -- Linear Encoding Scheme for Weighted Finite Automata -- The Generalization of Generalized Automata: Expression Automata -- An Automata Approach to Match Gapped Sequence Tags Against Protein Database -- State Complexity of Concatenation and Complementation of Regular Languages -- Minimal Unambiguous ?NFA -- Substitutions, Trajectories and Noisy Channels -- State Complexity and the Monoid of Transformations of a Finite Set -- An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract) -- Time and Space Efficient Algorithms for Constrained Sequence Alignment -- Stochastic Context-Free Graph Grammars for Glycoprotein Modelling -- Parametric Weighted Finite Automata for Figure Drawing -- Regional Finite-State Error Repair -- Approximating Dependency Grammars Through Intersection of Regular Languages -- On the Equivalence-Checking Problem for a Model of Programs Related With Multi-tape Automata -- Poster Papers -- Tight Bounds for NFA to DFCA Transformations for Binary Alphabets -- Simulating the Process of Gene Assembly in Ciliates -- A BDD-Like Implementation of an Automata Package -- Approximation to the Smallest Regular Expression for a Given Regular Language -- Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory -- Does Hausdorff Dimension Measure Texture Complexity? -- Combining Regular Expressions with (Near-)Optimal Brzozowski Automata -- From Automata to Semilinear Sets: A Logical Solution for Sets ( , ) -- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids -- Minimalizations of NFA Using the Universal Automaton -- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata -- Size Reduction of Multitape Automata -- Testability of Oracle Automata -- Magic Numbers for Symmetric Difference NFAs. |
| Record Nr. | UNINA-9910768455403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language and Automata Theory and Applications [[electronic resource] ] : 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings / / edited by Carlos Martín-Vide, Alexander Okhotin, Dana Shapira
| Language and Automata Theory and Applications [[electronic resource] ] : 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings / / edited by Carlos Martín-Vide, Alexander Okhotin, Dana Shapira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 470 p. 684 illus., 17 illus. in color.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Logic programming Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Logic in AI Discrete Mathematics in Computer Science |
| ISBN | 3-030-13435-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata -- Complexity -- Grammars -- Languages -- Graphs, trees and rewriting -- Words and codes. |
| Record Nr. | UNISA-996466429103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Language and Automata Theory and Applications : 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings / / edited by Carlos Martín-Vide, Alexander Okhotin, Dana Shapira
| Language and Automata Theory and Applications : 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings / / edited by Carlos Martín-Vide, Alexander Okhotin, Dana Shapira |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XVII, 470 p. 684 illus., 17 illus. in color.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Logic programming Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Logic in AI Discrete Mathematics in Computer Science |
| ISBN | 3-030-13435-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata -- Complexity -- Grammars -- Languages -- Graphs, trees and rewriting -- Words and codes. |
| Record Nr. | UNINA-9910337571603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||