LEADER 06749nam 22006975 450 001 996466028303316 005 20230222175015.0 010 $a3-540-30500-9 024 7 $a10.1007/b105090 035 $a(CKB)1000000000212686 035 $a(SSID)ssj0000177139 035 $a(PQKBManifestationID)11165424 035 $a(PQKBTitleCode)TC0000177139 035 $a(PQKBWorkID)10216436 035 $a(PQKB)10631646 035 $a(DE-He213)978-3-540-30500-2 035 $a(MiAaPQ)EBC3068346 035 $a(PPN)123091160 035 $a(EXLCZ)991000000000212686 100 $a20100715d2005 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and Application of Automata$b[electronic resource] $e9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers /$fedited by Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 336 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3317 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24318-6 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 330 $aThis volume of Lecture Notes in Computer Science contains the revised versions of the papers presented at the 9th International Conference on Implemen- tion and Application of Automata, CIAA 2004. Also included are the extended abstracts of the posters accepted to the conference. The conference was held at Queen?s University in Kingston, Ontario, Canada on July 22?24, 2004. As for its predecessors, the theme of CIAA 2004 was the implementation of automata and grammars of all types and their application in other ?elds. The topics of the papers presented at the conference range from applications of automata in natural language and speech processing to protein sequencingandgenecompression,andfromstatecomplexityandnewalgorithms for automata operations to applications of quantum ?nite automata. The25regularpapersand14posterpaperswereselectedfrom62submissions totheconference.EachsubmittedpaperwasevaluatedbyatleastthreeProgram Committee members, with the help of external referees. Based on the referee reports, the paper ?Substitutions, Trajectories and Noisy Channels? by L. Kari, S. Konstantinidis and P. Sosī ?k was chosen as the winner of the CIAA 2004 Best Paper Award. The award is sponsored by the University of California at Santa Barbara. The authors of the papers presented here come from the following countries and regions: Austria, Canada, Czech Republic, Finland, France, Germany, Hong Kong, Netherlands, Portugal, Russia, Slovakia, South Africa, Spain, UK, and USA. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3317 606 $aArtificial intelligence 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 615 0$aArtificial intelligence. 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 14$aArtificial Intelligence. 615 24$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 676 $a511.3/5 702 $aDomaratzki$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOkhotin$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSalomaa$b Kai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aYu$b Sheng$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466028303316 996 $aImplementation and Application of Automata$92860279 997 $aUNISA