Automata implementation. 4th international workshop, WIA '99, Potsdam, Germany, July 17--19, 1999. Revised papers (Q5960799)

The articles of mathematical interest will be reviewed individually. The preceding workshop (3rd, 1998) has been reviewed (see Zbl 0929.00063). Indexed articles: \textit{Amilhastre, Jérôme; Janssen, Philippe; Vilarem, Marie-Catherine}, FA minimisation heuristics for a class of finite languages, 1-12 [Zbl 1050.68087] \textit{Andary, Philippe; Caron, Pascal; Champarnaud, Jean-Marc; Duchamp, Gérard; Flouret, Marianne; Laugerotte, Éric}, SEA: A symbolic environment for automata theory, 13-26 [Zbl 1050.68587] \textit{Bergeron, Anne; Catalano, Riccardo}, Analysis of reactive systems with \(n\) timers, 27-38 [Zbl 1050.68588] \textit{Braune, Beatrix; Diehl, Stephan; Kerren, Andreas; Wilhelm, Reinhard}, Animation of the generation and computation of finite automata for learning software, 39-47 [Zbl 1050.97500] \textit{Calude, Cristian S.; Salomaa, Kai; Yu, Sheng}, Metric lexical analysis, 48-59 [Zbl 1050.68090] \textit{Câmpeanu, C.; Culik, K.; Salomaa, Kai; Yu, Sheng}, State complexity of basic operations on finite languages, 60-70 [Zbl 1050.68091] \textit{Daciuk, Jan}, Treatment of unknown words, 71-80 [Zbl 1050.68602] \textit{Eramian, Mark G.}, Computing entropy maps of finite-automaton-encoded binary images, 81-90 [Zbl 1050.68567] \textit{Giammarresi, Dora; Ponty, Jean-Luc; Wood, Derick}, Thompson digraphs: A characterization, 91-100 [Zbl 1050.68092] \textit{Jürgensen, Helmut; Staiger, Ludwig}, Finite automata encoding geometric figures, 101-108 [Zbl 1050.68568] \textit{Kiraz, George Anton}, Compressed storage of sparse finite-state transducers, 109-121 [Zbl 1050.68589] \textit{van Noord, Gertjan; Gerdemann, Dale}, An extendible regular expression compiler for finite-state approaches in natural language processing, 122-139 [Zbl 1050.68604] \textit{Păun, Gheorghe; Thierrin, Gabriel}, Multiset processing by means of systems of finite state transducers, 140-157 [Zbl 1050.68044] \textit{Seuring, M.; Gössel, M.}, A structural method for output compaction of sequential automata implemented as circuits, 158-163 [Zbl 1050.68591] \textit{Trahtman, A. N.}, An algorithm to verify local threshold testability of deterministic finite automata, 164-173 [Zbl 1050.68097] \textit{Watson, Bruce W.}, A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata, 174-182 [Zbl 1050.68592]