default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd WIA 1998: Rouen, France
- Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers. Lecture Notes in Computer Science 1660, Springer 1999, ISBN 3-540-66652-4 - Jürgen Albert, Dora Giammarresi, Derick Wood:
Extended Context-Free Grammars and Normal Form Algorithms. 1-12 - Norbert Blum:
On Parsing LL-Languages. 13-21 - Heiko Goeman:
On Parsing and Condensing Substrings of LR Languages in Linear Time. 22-42 - Cezar Câmpeanu
, Nicolae Santean, Sheng Yu:
Minimal Cover-Automata for Finite Languages. 43-56 - Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty:
Determinization of Glushkov Automata. 57-68 - Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu:
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. 69-81 - Zdenek Tronícek:
Operations on DASG. 82-91 - Jan Holub, Borivoj Melichar:
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. 92-99 - Denis Maurel, Brigitte Le Pévédic, Olivier Rousseau:
The Syntactic Prediction with Token Automata: Application to HandiAS System. 100-109 - Thierry Poibeau:
Bi-directional Automata to Extract Complex Phrases from Texts. 110-120 - Bruce W. Watson:
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs. 121-132 - Matti Nykänen:
Using Acceptors as Transducers. 133-148 - Dominique L'Her, Philippe Le Parc, Lionel Marcé:
Proving Sequential Function Chart Programs Using Automata. 149-163 - Marie-Chantal Beaulieu, Anne Bergeron:
Automata and Computational Probabilities. 164-177 - Jean-Francis Michon, Jean-Marc Champarnaud:
Automata and Binary Decision Diagrams. 178-182 - Gérard Duchamp, Marianne Flouret, Éric Laugerotte:
Operations over Automata with Multiplicities. 183-191 - Ricardo Ueda Karpischek:
Paging Automata. 192-198 - Yuri Velinov:
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment. 199-212 - Sandro Pedrazzini:
The Finite State Automata's Design Patterns. 213-219 - Xavier Augros:
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set. 220-225 - Are Uppman, Jean-Marc Champarnaud:
Autographe: A Graphical Version of Automate. 226-229 - Max Silberztein:
INTEX 4.1 for Windows: A Walkthrough. 230-243
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-27 01:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
