Vai al contenuto principale della pagina

Implementation 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.)



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Implementation 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.) Visualizza cluster
Pubblicazione: Berlin ; ; New York, : Springer, c2006
Edizione: 1st ed. 2006.
Descrizione fisica: 1 online resource (XIII, 360 p.)
Disciplina: 511.3
Soggetto topico: Machine theory
Altri autori: FarreJacques  
LitovskyIgor  
SchmitzSylvain  
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Titolo autorizzato: Implementation and application of automata  Visualizza cluster
ISBN: 3-540-33097-6
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910483513403321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Lecture notes in computer science ; ; 3845. LNCS sublibrary. : SL 1, . -Theoretical computer science and general issues.