Info
Automata, Languages and Programming [[electronic resource] ] : 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings / / edited by Josep Diaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella
| Automata, Languages and Programming [[electronic resource] ] : 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings / / edited by Josep Diaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XXXVIII, 1256 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer science—Mathematics Numerical analysis Data structures (Computer science) Software Engineering/Programming and Operating Systems Theory of Computation Discrete Mathematics in Computer Science Numeric Computing Data Structures |
| ISBN | 3-540-27836-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Self-Adjusting Computation -- The Past, Present, and Future of Web Search Engines -- What Do Program Logics and Type Systems Have in Common? -- Feasible Proofs and Computations: Partnership and Fusion -- Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input -- Testing, Optimizaton, and Games -- Contributed Papers -- Deciding Knowledge in Security Protocols Under Equational Theories -- Representing Nested Inductive Types Using W-Types -- Algorithms for Multi-product Pricing -- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas -- Linear and Branching Metrics for Quantitative Transition Systems -- Learning a Hidden Subgraph -- Optimal Reachability for Weighted Timed Games -- Wavelength Assignment in Optical Networks with Fixed Fiber Capacity -- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs -- A ?-Calculus for Resource Separation -- The Power of Verification for One-Parameter Agents -- Group Spreading: A Protocol for Provably Secure Distributed Name Service -- Further Improvements in Competitive Guarantees for QoS Buffering -- Competition-Induced Preferential Attachment -- Approximating Longest Directed Paths and Cycles -- Definitions and Bounds for Self-Healing Key Distribution Schemes -- Tree-Walking Automata Cannot Be Determinized -- Projecting Games on Hypercoherences -- An Analog Characterization of Elementarily Computable Functions over the Real Numbers -- Model Checking with Multi-valued Logics -- The Complexity of Partition Functions -- Comparing Recursion, Replication, and Iteration in Process Calculi -- Dynamic Price Sequence and Incentive Compatibility -- The Complexity of Equivariant Unification -- Coordination Mechanisms -- Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help -- Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities -- Coloring Semirandom Graphs Optimally -- Sublinear-Time Approximation for Clustering Via Random Sampling -- Solving Two-Variable Word Equations -- Backtracking Games and Inflationary Fixed Points -- A PTAS for Embedding Hypergraph in a Cycle -- Towards an Algebraic Theory of Typed Mobile Processes -- Ecological Turing Machines -- Locally Consistent Constraint Satisfaction Problems -- Quantum Query Complexity of Some Graph Problems -- A Domain Theoretic Account of Picard’s Theorem -- Interactive Observability in Ludics -- Easily Refutable Subformulas of Large Random 3CNF Formulas -- On Graph Problems in a Semi-streaming Model -- Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks -- Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits -- Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In -- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up -- Selfish Unsplittable Flows -- A General Technique for Managing Strings in Comparison-Driven Data Structures -- Greedy Regular Expression Matching -- A Time Algorithm for d-Dimensional Protein Folding in the HP-Model -- Nash Equilibria in Discrete Routing Games with Convex Latency Functions -- Improved Results for Data Migration and Open Shop Scheduling -- Deterministic M2M Multicast in Radio Networks -- Syntactic Control of Concurrency -- Linear-Time List Decoding in Error-Free Settings -- A Categorical Model for the Geometry of Interaction -- Testing Monotonicity over Graph Products -- The Minimum-Entropy Set Cover Problem -- Communication Versus Computation -- Optimal Website Design with the Constrained Subtree Selection Problem -- Simple Permutations Mix Well -- Closest Pair Problems in Very High Dimensions -- Universality in Quantum Computation -- Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design -- Fairness to All While Downsizing -- A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems -- A Faster Algorithm for Minimum Cycle Basis of Graphs -- The Black-Box Complexity of Nearest Neighbor Search -- Regular Solutions of Language Inequalities and Well Quasi-orders -- A Calculus of Coroutines -- Almost Optimal Decentralized Routing in Long-Range Contact Networks -- Word Problems on Compressed Words -- Complexity of Pseudoknot Prediction in Simple Models -- Property Testing of Regular Tree Languages -- Entropy as a Fixed Point -- Transparent Long Proofs: A First PCP Theorem for -- A Time Lower Bound for Satisfiability -- Some Results on Effective Randomness -- A Polynomial Quantum Query Lower Bound for the Set Equality Problem -- Succinct Representations of Functions -- A Note on Karr’s Algorithm -- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs -- Efficient Consistency Proofs for Generalized Queries on a Committed Database -- A -Approximation Algorithm for Rectangle Tiling -- Extensional Theories and Rewriting -- Hardness of String Similarity Search and Other Indexing Problems -- A Syntactic Characterization of Distributive LTL Queries -- Online Scheduling with Bounded Migration -- On the Expressive Power of Monadic Least Fixed Point Logic -- Counting in Trees for Free -- Games with Winning Conditions of High Borel Complexity -- Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas -- LA, Permutations, and the Hajós Calculus -- A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles -- Efficiently Computing Succinct Trade-Off Curves -- On Randomization Versus Synchronization in Distributed Systems -- A New Algorithm for Optimal Constraint Satisfaction and Its Implications -- On the Power of Ambainis’s Lower Bounds. |
| Record Nr. | UNISA-996465487903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings / / edited by Josep Diaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella
| Automata, Languages and Programming : 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings / / edited by Josep Diaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XXXVIII, 1256 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer science—Mathematics Numerical analysis Data structures (Computer science) Software Engineering/Programming and Operating Systems Theory of Computation Discrete Mathematics in Computer Science Numeric Computing Data Structures |
| ISBN | 3-540-27836-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Self-Adjusting Computation -- The Past, Present, and Future of Web Search Engines -- What Do Program Logics and Type Systems Have in Common? -- Feasible Proofs and Computations: Partnership and Fusion -- Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input -- Testing, Optimizaton, and Games -- Contributed Papers -- Deciding Knowledge in Security Protocols Under Equational Theories -- Representing Nested Inductive Types Using W-Types -- Algorithms for Multi-product Pricing -- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas -- Linear and Branching Metrics for Quantitative Transition Systems -- Learning a Hidden Subgraph -- Optimal Reachability for Weighted Timed Games -- Wavelength Assignment in Optical Networks with Fixed Fiber Capacity -- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs -- A ?-Calculus for Resource Separation -- The Power of Verification for One-Parameter Agents -- Group Spreading: A Protocol for Provably Secure Distributed Name Service -- Further Improvements in Competitive Guarantees for QoS Buffering -- Competition-Induced Preferential Attachment -- Approximating Longest Directed Paths and Cycles -- Definitions and Bounds for Self-Healing Key Distribution Schemes -- Tree-Walking Automata Cannot Be Determinized -- Projecting Games on Hypercoherences -- An Analog Characterization of Elementarily Computable Functions over the Real Numbers -- Model Checking with Multi-valued Logics -- The Complexity of Partition Functions -- Comparing Recursion, Replication, and Iteration in Process Calculi -- Dynamic Price Sequence and Incentive Compatibility -- The Complexity of Equivariant Unification -- Coordination Mechanisms -- Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help -- Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities -- Coloring Semirandom Graphs Optimally -- Sublinear-Time Approximation for Clustering Via Random Sampling -- Solving Two-Variable Word Equations -- Backtracking Games and Inflationary Fixed Points -- A PTAS for Embedding Hypergraph in a Cycle -- Towards an Algebraic Theory of Typed Mobile Processes -- Ecological Turing Machines -- Locally Consistent Constraint Satisfaction Problems -- Quantum Query Complexity of Some Graph Problems -- A Domain Theoretic Account of Picard’s Theorem -- Interactive Observability in Ludics -- Easily Refutable Subformulas of Large Random 3CNF Formulas -- On Graph Problems in a Semi-streaming Model -- Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks -- Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits -- Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In -- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up -- Selfish Unsplittable Flows -- A General Technique for Managing Strings in Comparison-Driven Data Structures -- Greedy Regular Expression Matching -- A Time Algorithm for d-Dimensional Protein Folding in the HP-Model -- Nash Equilibria in Discrete Routing Games with Convex Latency Functions -- Improved Results for Data Migration and Open Shop Scheduling -- Deterministic M2M Multicast in Radio Networks -- Syntactic Control of Concurrency -- Linear-Time List Decoding in Error-Free Settings -- A Categorical Model for the Geometry of Interaction -- Testing Monotonicity over Graph Products -- The Minimum-Entropy Set Cover Problem -- Communication Versus Computation -- Optimal Website Design with the Constrained Subtree Selection Problem -- Simple Permutations Mix Well -- Closest Pair Problems in Very High Dimensions -- Universality in Quantum Computation -- Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design -- Fairness to All While Downsizing -- A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems -- A Faster Algorithm for Minimum Cycle Basis of Graphs -- The Black-Box Complexity of Nearest Neighbor Search -- Regular Solutions of Language Inequalities and Well Quasi-orders -- A Calculus of Coroutines -- Almost Optimal Decentralized Routing in Long-Range Contact Networks -- Word Problems on Compressed Words -- Complexity of Pseudoknot Prediction in Simple Models -- Property Testing of Regular Tree Languages -- Entropy as a Fixed Point -- Transparent Long Proofs: A First PCP Theorem for -- A Time Lower Bound for Satisfiability -- Some Results on Effective Randomness -- A Polynomial Quantum Query Lower Bound for the Set Equality Problem -- Succinct Representations of Functions -- A Note on Karr’s Algorithm -- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs -- Efficient Consistency Proofs for Generalized Queries on a Committed Database -- A -Approximation Algorithm for Rectangle Tiling -- Extensional Theories and Rewriting -- Hardness of String Similarity Search and Other Indexing Problems -- A Syntactic Characterization of Distributive LTL Queries -- Online Scheduling with Bounded Migration -- On the Expressive Power of Monadic Least Fixed Point Logic -- Counting in Trees for Free -- Games with Winning Conditions of High Borel Complexity -- Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas -- LA, Permutations, and the Hajós Calculus -- A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles -- Efficiently Computing Succinct Trade-Off Curves -- On Randomization Versus Synchronization in Distributed Systems -- A New Algorithm for Optimal Constraint Satisfaction and Its Implications -- On the Power of Ambainis’s Lower Bounds. |
| Record Nr. | UNINA-9910144158103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorics on Words [[electronic resource] ] : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni
| Combinatorics on Words [[electronic resource] ] : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 263 p. 37 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Software engineering Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Software Engineering |
| ISBN | 3-642-40579-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466023603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics on Words : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni
| Combinatorics on Words : 9th International Conference, WORDS 2013, Turku, Finland, September 16-20, 2013, Proceedings / / edited by Juhani Karhumäki, Arto Lepistö, Luca Zamboni |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 263 p. 37 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence Software engineering Theory of Computation Formal Languages and Automata Theory Artificial Intelligence Software Engineering |
| ISBN | 3-642-40579-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483571203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science -- Theory and Applications [[electronic resource] ] : 7th International Computer Science Symposium in Russia, CSR 2012, Niszhny Novgorod, Russia, July 3-7, 2012, Proceedings / / edited by Edward Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii
| Computer Science -- Theory and Applications [[electronic resource] ] : 7th International Computer Science Symposium in Russia, CSR 2012, Niszhny Novgorod, Russia, July 3-7, 2012, Proceedings / / edited by Edward Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XXIII, 327 p. 25 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Machine theory Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science Theory of Computation Mathematics of Computing |
| ISBN | 3-642-30642-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465274703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||
Finite-State Methods and Natural Language Processing [[electronic resource] ] : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki
| Finite-State Methods and Natural Language Processing [[electronic resource] ] : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 312 p.) |
| Disciplina | 006.3/5 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Natural language processing (Computer science) Algorithms Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Natural Language Processing (NLP) Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN |
1-281-38797-5
3-540-35469-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Characterizations of Regularity -- Finnish Optimality-Theoretic Prosody -- Contributed Papers -- Partitioning Multitape Transducers -- Squeezing the Infinite into the Finite -- A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers -- Finite-State Registered Automata and Their Uses in Natural Languages -- TAGH: A Complete Morphology for German Based on Weighted Finite State Automata -- Klex: A Finite-State Transducer Lexicon of Korean -- Longest-Match Pattern Matching with Weighted Finite State Automata -- Finite-State Syllabification -- Algorithms for Minimum Risk Chunking -- Collapsing ?-Loops in Weighted Finite-State Machines -- WFSM Auto-intersection and Join Algorithms -- Further Results on Syntactic Ambiguity of Internal Contextual Grammars -- Error-Driven Learning with Bracketing Constraints -- Parsing with Lexicalized Probabilistic Recursive Transition Networks -- Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines -- Modelling the Semantics of Calendar Expressions as Extended Regular Expressions -- Using Finite State Technology in a Tool for Linguistic Exploration -- Applying a Finite Automata Acquisition Algorithm to Named Entity Recognition -- Principles, Implementation Strategies, and Evaluation of a Corpus Query System -- On Compact Storage Models for Gazetteers -- German Compound Analysis with wfsc -- Scaling an Irish FST Morphology Engine for Use on Unrestricted Text -- Improving Inter-level Communication in Cascaded Finite-State Partial Parsers -- Pivotal Synchronization Languages: A Framework for Alignments -- Abstracts of Interactive Presentations -- A Complete FS Model for Amharic Morphographemics -- Tagging with Delayed Disambiguation -- A New Algorithm for Unsupervised Induction of Concatenative Morphology -- Morphological Parsing of Tone: An Experiment with Two-Level Morphology on the Ha Language -- Describing Verbs in Disjoining Writing Systems -- An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System -- Finite State Transducers Based on k-TSS Grammars for Speech Translation -- Abstracts of Software Demos -- Unsupervised Morphology Induction Using Morfessor -- SProUT – A General-Purpose NLP Framework Integrating Finite-State and Unification-Based Grammar Formalisms -- Tool Demonstration: Functional Morphology -- From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology -- A Programming Language for Finite State Transducers -- FIRE Station. |
| Record Nr. | UNISA-996465914203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal and Natural Computing [[electronic resource] ] : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
| Formal and Natural Computing [[electronic resource] ] : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XXXVI, 436 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Architecture, Computer Computers Algorithms Computer logic Data structures (Computer science) Programming Techniques Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Data Structures |
| ISBN | 3-540-45711-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Words, Languages, Automata -- Balanced Grammars and Their Languages -- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids -- The Delta Operation: From Strings to Trees to Strings -- Infinite Solutions of Marked Post Correspondence Problem -- The Branching Point Approach to Conway’s Problem -- A Survey of Some Quantitative Approaches to the Notion of Information -- Nondeterministic Trajectories -- Binary Patterns in Infinite Binary Words -- Graph Transformations -- A Sight-seeing Tour of the Computational Landscape of Graph Transformation -- Local Action Systems and DPO Graph Transformation -- Bisimulation Equivalences for Graph Grammars -- Petri Nets -- High-Level Net Processes -- Petri Net Control for Grammar Systems -- Regular Event Structures and Finite Petri Nets: A Conjecture -- Concurrent Computing -- Towards Team-Automata-Driven Object-Oriented Collaborative Work -- Grammars as Processes -- Temporal Concurrent Constraint Programming: Applications and Behavior -- Molecular Computing -- Rewriting P Systems with Conditional Communication -- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation -- Upper Bounds for Restricted Splicing -- Codes, Involutions, and DNA Encodings -- DNA Manipulations in Ciliates -- A Magic Pot : Self-assembly Computation Revisited. |
| Record Nr. | UNISA-996466036103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal and Natural Computing : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa
| Formal and Natural Computing : Essays Dedicated to Grzegorz Rozenberg / / edited by Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, Arto K. Salomaa |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XXXVI, 436 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computer architecture Computers Algorithms Computer logic Data structures (Computer science) Programming Techniques Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Data Structures |
| ISBN | 3-540-45711-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Words, Languages, Automata -- Balanced Grammars and Their Languages -- Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids -- The Delta Operation: From Strings to Trees to Strings -- Infinite Solutions of Marked Post Correspondence Problem -- The Branching Point Approach to Conway’s Problem -- A Survey of Some Quantitative Approaches to the Notion of Information -- Nondeterministic Trajectories -- Binary Patterns in Infinite Binary Words -- Graph Transformations -- A Sight-seeing Tour of the Computational Landscape of Graph Transformation -- Local Action Systems and DPO Graph Transformation -- Bisimulation Equivalences for Graph Grammars -- Petri Nets -- High-Level Net Processes -- Petri Net Control for Grammar Systems -- Regular Event Structures and Finite Petri Nets: A Conjecture -- Concurrent Computing -- Towards Team-Automata-Driven Object-Oriented Collaborative Work -- Grammars as Processes -- Temporal Concurrent Constraint Programming: Applications and Behavior -- Molecular Computing -- Rewriting P Systems with Conditional Communication -- An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation -- Upper Bounds for Restricted Splicing -- Codes, Involutions, and DNA Encodings -- DNA Manipulations in Ciliates -- A Magic Pot : Self-assembly Computation Revisited. |
| Record Nr. | UNINA-9910145794203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
