LEADER 04272nam 2200577 a 450 001 9910483513403321 005 20200520144314.0 010 $a3-540-33097-6 024 7 $a10.1007/11605157 035 $a(CKB)1000000000232748 035 $a(SSID)ssj0000318212 035 $a(PQKBManifestationID)11253341 035 $a(PQKBTitleCode)TC0000318212 035 $a(PQKBWorkID)10308459 035 $a(PQKB)11481167 035 $a(DE-He213)978-3-540-33097-4 035 $a(MiAaPQ)EBC3067794 035 $a(PPN)123130247 035 $a(EXLCZ)991000000000232748 100 $a20060118d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aImplementation and application of automata $e10th international conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005 : revised selected papers /$fJacques Farre, Igor Litovsky, Sylvain Schmitz (eds.) 205 $a1st ed. 2006. 210 $aBerlin ;$aNew York $cSpringer$dc2006 215 $a1 online resource (XIII, 360 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3845 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31023-1 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Languages Recognizable by Quantum Finite Automata -- The Language, the Expression, and the (Small) Automaton -- Technical Contributions -- Minimization of Non-deterministic Automata with Large Alphabets -- Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata -- Component Composition Preserving Behavioural Contracts Based on Communication Traces -- Strong Retiming Equivalence of Synchronous Schemes -- Prime Normal Form and Equivalence of Simple Grammars -- An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata -- Finite Automata and Unions of Regular Patterns with Bounded Constant Segments -- Inside Vaucanson -- Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton -- Shorter Regular Expressions from Finite-State Automata -- Wind in the Willows ? Generating Music by Means of Tree Transducers -- On Deterministic Catalytic Systems -- Restricting the Use of Auxiliary Symbols for Restarting Automata -- A Class of Rational n-WFSM Auto-intersections -- Experiments with Deterministic ?-Automata for Formulas of Linear Temporal Logic -- Computing Affine Hulls over and from Sets Represented by Number Decision Diagrams -- Tree Automata and XPath on Compressed Trees -- Deeper Connections Between LTL and Alternating Automata -- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words -- Observations on Determinization of Büchi Automata -- The Interval Rank of Monotonic Automata -- Compressing XML Documents Using Recursive Finite State Automata -- Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment -- Size Reduction of Multitape Automata -- Robust Spelling Correction -- On Two-Dimensional Pattern Matching by Finite Automata -- Poster Abstracts -- Incremental and Semi-incremental Construction of Pseudo-Minimal Automata -- Is Learning RFSAs Better Than Learning DFAs? -- Learning Stochastic Finite Automata for Musical Style Recognition -- Simulation of Soliton Circuits -- Acyclic Automata with Easy-to-Find Short Regular Expressions -- On the Equivalence Problem for Programs with Mode Switching -- Automata and AB-Categorial Grammars -- On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set. 410 0$aLecture notes in computer science ;$v3845. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aMachine theory$vCongresses 615 0$aMachine theory 676 $a511.3 701 $aFarre$b Jacques$01756266 701 $aLitovsky$b Igor$01756267 701 $aSchmitz$b Sylvain$01756268 712 12$aCIAA 2005 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483513403321 996 $aImplementation and application of automata$94193468 997 $aUNINA