You have Guest access.
Log In
Shen Yu and Andrei Paun
Front matter
1-33
Synthesizing State-Based Object Systems from LSC Specifications
34-46
Applications of Finite-State Transducers in Natural Language Processing
47-56
Fast Implementations of Automata Computations
57-66
Regularly Extended Two-Way Nondeterministic Tree Automata
67-79
Glushkov Construction for Multiplicities
80-93
Implicit Structures to Implement NFA’s from Regular Expressions
94-104
New Finite Automaton Constructions Based on Canonical Derivatives
105-112
Experiments with Automata Compression
113-121
Computing Raster Images from Grid Picture Grammars
122-134
A Basis for Looping Extensions to Discriminating-Reverse Parsing
135-144
Automata for Pro-V Topologies
145-156
Reachability and Safety in Queue Systems
157-169
Generalizing the Discrete Timed Automaton
170-181
Factorization of Ambiguous Finite-State Transducers
182-194
MONA Implementation Secrets
195-207
Cursors
208-216
An Automaton Model of User-Controlled Navigation on the Web
217-229
Direct Construction of Minimal Acyclic Subsequential Transducers
230-242
Generic ε-Removal Algorithm for Weighted Automata
243-251
An O (n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
252-262
Unary Language Concatenation and Its State Complexity
263-271
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
272-278
State Complexity and Jacobsthal’s Function
279-291
A Package for the Implementation of Block Codes as Finite Automata
293-301
Regional Least-Cost Error Repair
302-310
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata
311-317
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
318-326
The MERLin Environment Applied to ⋆-NFAs
327-328
Visual Exploration of Generation Algorithms for Finite Automata on the Web
329-330
TREEBAG
331-332
Word Random Access Compression
333-334
Extended Sequentialization of Transducers
335-336
Lessons from INR in the Specification of Transductions
337-339
Part-of-Speech Tagging with Two Sequential Transducers
340-342
Solving Complex Problems Efficiently with Adaptive Automata
Back matter
David Harel and Hillel Kugler
Lauri Karttunen
Anne Bergeron and Sylvie Hamel
Anne Brüggemann-Klein and Derick Wood
Pascal Caron and Marianne Flouret
Jean-Marc Champarnaud
Jean-Marc Champarnaud and D. Ziadi
Jan Daciuk
Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs and Hans-Jörg Kreowski
Jacques Farré and José Fortes Gálvez
Pierre-Cyrille Héam
Oscar H. Ibarra
Oscar H. Ibarra and Jianwen Su
André Kempe
Nils Klarlund, Anders Møller and Michael I. Schwartzbach
Vincent Le Maout
K. Lodaya and R. Ramanujam
Stoyan Mihov and Denis Maurel
Mehryar Mohri
Andrei Păun, Nicolae Sântean and Sheng Yu
Giovanni Pighizzini
Dominik Schmitz and Jens Vöge
Jeffrey Shallit
Priti Shankar, K. Sasidharan, Vikas Aggarwal and B. Sundar Rajan
M. Vilares, V. M. Darriba and F. J. Ribadas
H. Todd Wareham
Bruce W. Watson
Lynette van Zijl, John-Paul Harper and Frank Olivier
Stephan Diehl, Andreas Kerren and Torsten Weller
Frank Drewes and Renate Klempien-Hinrichs
Jiří Dvorský and Václav Snášel
Tamás Gaál
J. Howard Johnson
João José Neto
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