LEADER 06011nam 22007815 450 001 9910483560603321 005 20230406032424.0 010 $a3-540-76336-8 024 7 $a10.1007/978-3-540-76336-9 035 $a(CKB)1000000000490662 035 $a(SSID)ssj0000318211 035 $a(PQKBManifestationID)11245584 035 $a(PQKBTitleCode)TC0000318211 035 $a(PQKBWorkID)10308789 035 $a(PQKB)10576921 035 $a(DE-He213)978-3-540-76336-9 035 $a(MiAaPQ)EBC6284064 035 $a(MiAaPQ)EBC4976195 035 $a(MiAaPQ)EBC336997 035 $a(Au-PeEL)EBL336997 035 $a(OCoLC)191470896 035 $a(PPN)123728843 035 $a(EXLCZ)991000000000490662 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and Application of Automata $e12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers /$fedited by Jan Holub, Jan ?dárek 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XIII, 326 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4783 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-76335-X 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 330 $aThe 12th International Conference on Implementation and Application of - tomata CIAA 2007 washeld at the Czech Technical Universityin Prague,Czech Republic on July 16?18, 2007. These proceedings contain the papers that were presented at CIAA 2007, as well as the abstracts of the poster papers that were displayed during the conference. The proceedings also include the abstracts and extended abstracts offourinvitedlecturespresentedbyGheorghePau ? n,MichaelRiley,MosheVardi, and Bruce W. Watson. The 23 regular papers and 7 poster papers were selected from 79 submitted papers covering various topics in the theory, implementation, and application of automataandrelatedstructures.Eachsubmitted paper wasreviewedbyatleast threeProgramCommitteemembers,with the assistanceofreferees.Theauthors of the papers presented here come from the following countries: Canada, Czech Republic, Denmark, Finland, France, Germany, Greece, Israel, Italy, Poland, Romania, Russia, South Africa, Spain, Sweden, UK, and USA. We wish to thank all those who made this meeting possible: the authors for submitting papers, the Program Committee members and external referees (listed on pages VII and VIII) for their excellent work, and last but not least our four invited speakers. Finally, we wish to express our sincere appreciation to the sponsors and local organizers. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4783 606 $aArtificial intelligence 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial Intelligence 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 615 0$aArtificial intelligence. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 14$aArtificial Intelligence. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 676 $a006.31 702 $aHolub$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $a?dárek$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483560603321 996 $aImplementation and Application of Automata$93552118 997 $aUNINA