Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi
Revised Papers of the Third International Workshop on Implementing Automata
WIA, 1998.

@proceedings{WIA-1998,
	address       = "Rouen, France",
	editor        = "Jean-Marc Champarnaud and Denis Maurel and Djelloul Ziadi",
	isbn          = "3-540-66652-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Third International Workshop on Implementing Automata}",
	volume        = 1660,
	year          = 1998,
}

Contents (22 items)

12 ×#automaton
5 ×#finite
3 ×#implementation
3 ×#on the
2 ×#algorithm
2 ×#parsing
2 ×#using

WIA-1998-AlbertGW #algorithm #context-free grammar #normalisation

Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.

WIA-1998-Blum #on the #parsing

On Parsing LL-Languages (NB), pp. 13–21.

WIA-1998-Goeman #linear #lr #on the #parsing #string

On Parsing and Condensing Substrings of LR Languages in Linear Time (HG), pp. 22–42.

WIA-1998-CampeanuSY #finite

Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.

WIA-1998-ChamparnaudZP #automaton

Determinization of Glushkov Automata (JMC, DZ, JLP), pp. 57–68.

WIA-1998-HuerterSWY #automaton #finite #implementation

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.

WIA-1998-Tronicek

Operations on DASG (ZT), pp. 82–91.

WIA-1998-HolubM #approximate #automaton #finite #implementation #nondeterminism #pattern matching

Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.

WIA-1998-MaurelPR #automaton #predict

The Syntactic Prediction with Token Automata: Application to HandiAS System (DM, BLP, OR), pp. 100–109.

WIA-1998-Poibeau #automaton

Bi-directional Automata to Extract Complex Phrases from Texts (TP), pp. 110–120.

WIA-1998-Watson #algorithm #performance

A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.

WIA-1998-Nykanen #transducer #using

Using Acceptors as Transducers (MN), pp. 133–148.

WIA-1998-LHerPM #automaton #proving #source code #using

Proving Sequential Function Chart Programs Using Automata (DL, PLP, LM), pp. 149–163.

WIA-1998-BeaulieuB #automaton

Automata and Computational Probabilities (MCB, AB), pp. 164–177.

WIA-1998-MichonC #automaton #diagrams

Automata and Binary Decision Diagrams (JFM, JMC), pp. 178–182.

WIA-1998-DuchampFL #automaton #multi

Operations over Automata with Multiplicities (GD, MF, ÉL), pp. 183–191.

WIA-1998-Karpischek #automaton

Paging Automata (RUK), pp. 192–198.

WIA-1998-Velinov #graph #implementation #on the #semantics #syntax

On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment (YV), pp. 199–212.

WIA-1998-Pedrazzini #automaton #design pattern #finite

The Finite State Automata’s Design Patterns (SP), pp. 213–219.

WIA-1998-Augros #automaton #finite #infinity #set #word

Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.

WIA-1998-UppmanC #named #visual notation

Autographe: A Graphical Version of Automate (AU, JMC), pp. 226–229.

WIA-1998-Silberztein

INTEX 4.1 for Windows: A Walkthrough (MS), pp. 230–243.