You have Guest access.
Log In
Jacques Farré, Igor Litovsky and Sylvain Schmitz
Front matter
1-14
Languages Recognizable by Quantum Finite Automata
15-30
The Language, the Expression, and the (Small) Automaton
31-42
Minimization of Non-deterministic Automata with Large Alphabets
43-53
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata
54-65
Component Composition Preserving Behavioural Contracts Based on Communication Traces
66-77
Strong Retiming Equivalence of Synchronous Schemes
78-89
Prime Normal Form and Equivalence of Simple Grammars
90-103
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata
104-115
Finite Automata and Unions of Regular Patterns with Bounded Constant Segments
116-128
Inside Vaucanson
129-140
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
141-152
Shorter Regular Expressions from Finite-State Automata
153-162
Wind in the Willows – Generating Music by Means of Tree Transducers
163-175
On Deterministic Catalytic Systems
176-187
Restricting the Use of Auxiliary Symbols for Restarting Automata
188-198
A Class of Rational n-WFSM Auto-intersections
199-212
Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic
213-224
Computing Affine Hulls over \mathbb Q{\mathbb Q} and \mathbb Z{\mathbb Z} from Sets Represented by Number Decision Diagrams
225-237
Tree Automata and XPath on Compressed Trees
238-249
Deeper Connections Between LTL and Alternating Automata
250-261
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words
262-272
Observations on Determinization of Büchi Automata
273-281
The Interval Rank of Monotonic Automata
282-293
Compressing XML Documents Using Recursive Finite State Automata
294-306
Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment
307-318
Size Reduction of Multitape Automata
319-328
Robust Spelling Correction
329-340
On Two-Dimensional Pattern Matching by Finite Automata
341-342
Incremental and Semi-incremental Construction of Pseudo-Minimal Automata
343-344
Is Learning RFSAs Better Than Learning DFAs?
345-346
Learning Stochastic Finite Automata for Musical Style Recognition
347-348
Simulation of Soliton Circuits
349-350
Acyclic Automata with Easy-to-Find Short Regular Expressions
351-352
On the Equivalence Problem for Programs with Mode Switching
353-355
Automata and AB-Categorial Grammars
356-357
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info