Implementation and Application of Automata [[electronic resource] ] : 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers / / edited by Jan Holub, Jan Ždárek |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XIII, 326 p.) |
Disciplina | 006.31 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Computer science Algorithms Machine theory Artificial Intelligence Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN | 3-540-76336-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Spiking Neural P Systems Used as Acceptors and Transducers -- Linear-Time Model Checking: Automata Theory in Practice -- OpenFst: A General and Efficient Weighted Finite-State Transducer Library -- Automata Applications in Chip-Design Software -- Contributed Talks -- Synchronizing Automata Preserving a Chain of Partial Orders -- Reducing Acyclic Cover Transducers -- On-the-Fly Stuttering in the Construction of Deterministic ?-Automata -- Average Value and Variance of Pattern Statistics in Rational Models -- Weighted Automata and Weighted Logics with Discounting -- Regulated Nondeterminism in Pushdown Automata -- Deterministic Caterpillar Expressions -- Backward and Forward Bisimulation Minimisation of Tree Automata -- An Implementation of Deterministic Tree Automata Minimization -- Accelerating Boyer Moore Searches on Binary Texts -- On the Suffix Automaton with Mismatches -- On String Matching in Chunked Texts -- Factor Automata of Automata and Applications -- Subset Seed Automaton -- A Measure for the Degree of Nondeterminism of Context-Free Languages -- Efficient Computation of Throughput Values of Context-Free Languages -- Analyzing Ambiguity of Context-Free Grammars -- Efficient Enumeration of Regular Languages -- Multi-grain Relations -- Memory Reduction for Strategies in Infinite Games -- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Finite State Automata Representing Two-Dimensional Subshifts -- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages -- Poster Abstracts -- REGAL: A Library to Randomly and Exhaustively Generate Automata -- A Finite-State Super-Chunker -- The Constrained Longest Common Subsequence Problem for Degenerate Strings -- Finite Automata Accepting Star-Connected Languages -- Efficiently Matching with Local Grammars Using Prefix Overlay Transducers -- Significant Subpatterns Matching -- A New Method for Compiling Parallel Replacement Rules. |
Record Nr. | UNISA-996466240603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Implementation and Application of Automata : 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers / / edited by Jan Holub, Jan Ždárek |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XIII, 326 p.) |
Disciplina | 006.31 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Computer science Algorithms Machine theory Artificial Intelligence Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN | 3-540-76336-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Spiking Neural P Systems Used as Acceptors and Transducers -- Linear-Time Model Checking: Automata Theory in Practice -- OpenFst: A General and Efficient Weighted Finite-State Transducer Library -- Automata Applications in Chip-Design Software -- Contributed Talks -- Synchronizing Automata Preserving a Chain of Partial Orders -- Reducing Acyclic Cover Transducers -- On-the-Fly Stuttering in the Construction of Deterministic ?-Automata -- Average Value and Variance of Pattern Statistics in Rational Models -- Weighted Automata and Weighted Logics with Discounting -- Regulated Nondeterminism in Pushdown Automata -- Deterministic Caterpillar Expressions -- Backward and Forward Bisimulation Minimisation of Tree Automata -- An Implementation of Deterministic Tree Automata Minimization -- Accelerating Boyer Moore Searches on Binary Texts -- On the Suffix Automaton with Mismatches -- On String Matching in Chunked Texts -- Factor Automata of Automata and Applications -- Subset Seed Automaton -- A Measure for the Degree of Nondeterminism of Context-Free Languages -- Efficient Computation of Throughput Values of Context-Free Languages -- Analyzing Ambiguity of Context-Free Grammars -- Efficient Enumeration of Regular Languages -- Multi-grain Relations -- Memory Reduction for Strategies in Infinite Games -- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Finite State Automata Representing Two-Dimensional Subshifts -- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages -- Poster Abstracts -- REGAL: A Library to Randomly and Exhaustively Generate Automata -- A Finite-State Super-Chunker -- The Constrained Longest Common Subsequence Problem for Degenerate Strings -- Finite Automata Accepting Star-Connected Languages -- Efficiently Matching with Local Grammars Using Prefix Overlay Transducers -- Significant Subpatterns Matching -- A New Method for Compiling Parallel Replacement Rules. |
Record Nr. | UNINA-9910483560603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|