Implementation and Application of Automata 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Farré, Jacques (Επιμελητής έκδοσης), Litovsky, Igor (Επιμελητής έκδοσης), Schmitz, Sylvain (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
• Σειρά: Lecture Notes in Computer Science, 3845
• Θέματα: Computer science.; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

Πίνακας περιεχομένων:

• 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.