04272nam 2200577 a 450 991048351340332120200520144314.03-540-33097-610.1007/11605157(CKB)1000000000232748(SSID)ssj0000318212(PQKBManifestationID)11253341(PQKBTitleCode)TC0000318212(PQKBWorkID)10308459(PQKB)11481167(DE-He213)978-3-540-33097-4(MiAaPQ)EBC3067794(PPN)123130247(EXLCZ)99100000000023274820060118d2006 uy 0engurnn|008mamaatxtccrImplementation and application of automata 10th international conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005 : revised selected papers /Jacques Farre, Igor Litovsky, Sylvain Schmitz (eds.)1st ed. 2006.Berlin ;New York Springerc20061 online resource (XIII, 360 p.) Lecture notes in computer science,0302-9743 ;3845LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-31023-1 Includes bibliographical references and index.Invited 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.Lecture notes in computer science ;3845.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Machine theoryCongressesMachine theory511.3Farre Jacques1756266Litovsky Igor1756267Schmitz Sylvain1756268CIAA 2005MiAaPQMiAaPQMiAaPQBOOK9910483513403321Implementation and application of automata4193468UNINA