Implementation and application of automata. 5th international conference, CIAA 2000, London, Ontario, Canada, July 24--25, 2000. Revised papers (Q5941854)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implementation and application of automata. 5th international conference, CIAA 2000, London, Ontario, Canada, July 24--25, 2000. Revised papers |
scientific article; zbMATH DE number 1637188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation and application of automata. 5th international conference, CIAA 2000, London, Ontario, Canada, July 24--25, 2000. Revised papers |
scientific article; zbMATH DE number 1637188 |
Statements
Implementation and application of automata. 5th international conference, CIAA 2000, London, Ontario, Canada, July 24--25, 2000. Revised papers (English)
0 references
26 August 2001
0 references
The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Harel, David; Kugler, Hillel}, Synthesizing state-based object systems from LSC specifications, 1-33 [Zbl 0989.68087] \textit{Karttunen, Lauri}, Applications of finite-state transducers in natural language processing, 34-46 [Zbl 0989.68530] \textit{Bergeron, Anne; Hamel, Sylvie}, Fast implementations of automata computations, 47-56 [Zbl 0989.68056] \textit{Brüggemann-Klein, Anne; Wood, Derick}, Regularly extended two-way nondeterministic tree automata, 57-66 [Zbl 0989.68079] \textit{Caron, Pascal; Flouret, Marianne}, Glushkov construction for multiplicities, 67-79 [Zbl 0989.68075] \textit{Champarnaud, Jean-Marc}, Implicit structures to implement NFA's from regular expressions, 80-93 [Zbl 0989.68076] \textit{Champarnaud, Jean-Marc; Ziadi, D.}, New finite automaton constructions based on canonical derivatives, 94-104 [Zbl 0989.68077] \textit{Daciuk, Jan}, Experiments with automata compression, 105-112 [Zbl 0998.68684] \textit{Drewes, Frank; Ewert, Sigrid; Klempien-Hinrichs, Renate; Kreowski, Hans-Jörg}, Computing raster images from grid picture grammars, 113-121 [Zbl 0989.68063] \textit{Farré, Jacques; Gálvez, José Fortes}, A basis for looping extensions to discriminating-reverse parsing, 122-134 [Zbl 0989.68511] \textit{Héam, Pierre-Cyrille}, Automata for pro-\textbf{V} topologies, 135-144 [Zbl 0989.68071] \textit{Ibarra, Oscar H.}, Reachability and safety in queue systems, 145-156 [Zbl 0989.68078] \textit{Ibarra, Oscar H.; Su, Jianwen}, Generalizing the discrete timed automaton, 157-169 [Zbl 0989.68074] \textit{Kempe, André}, Factorization of ambiguous finite-state transducers, 170-181 [Zbl 0989.68073] \textit{Klarlund, Nils; Møller, Anders; Schwartzbach, Michael I.}, MONA implementation secrets, 182-194 [Zbl 0989.03500] \textit{Le Maout, Vincent}, Cursors, 195-207 [Zbl 0989.68545] \textit{Lodaya, K.; Ramanujam, R.}, An automaton model of user-controlled navigation on the web, 208-216 [Zbl 0989.68531] \textit{Mihov, Stoyan; Maurel, Denis}, Direct construction of minimal acyclic subsequential transducers, 217-229 [Zbl 0989.68072] \textit{Mohri, Mehryar}, Generic \(\epsilon\)-removal algorithm for weighted automata, 230-242 [Zbl 0999.68118] \textit{Păun, Andrei; Sântean, Nicolae; Yu, Sheng}, An \(O(n^2)\) algorithm for constructing minimal cover automata for finite languages, 243-251 [Zbl 0989.68070] \textit{Pighizzini, Giovanni}, Unary language concatenation and its state complexity, 252-262 [Zbl 0989.68081] \textit{Schmitz, Dominik; Vöge, Jens}, Implementation of a strategy improvement algorithm for finite-state parity games, 263-271 [Zbl 0989.68514] \textit{Shallit, Jeffrey}, State complexity and Jacobsthal's function, 272-278 [Zbl 0989.68080] \textit{Shankar, Priti; Sasidharan, K.; Aggarwal, Vikas; Sundar Rajan, B.}, A package for the implementation of block codes as finite automata, 279-292 [Zbl 0996.94528] \textit{Vilares, M.; Darriba, V. M.; Ribadas, F. J.}, Regional least-cost error repair, 293-301 [Zbl 0989.68515] \textit{Wareham, H. Todd}, The parametrized complexity of intersection and composition operations on sets of finite-state automata, 302-310 [Zbl 0999.68119] \textit{Watson, Bruce W.}, Directly constructing minimal DFAs: Combining two algorithms by Brzozowski, 311-317 [Zbl 0989.68512] \textit{van Zijl, Lynette; Harper, John-Paul; Olivier, Frank}, The MERLin environment applied to *-NFAs, 318-326 [Zbl 0989.68516] \textit{Diehl, Stephan; Kerren, Andreas; Weller, Torsten}, Visual exploration of generation algorithms for finite automata on the web, 327-328 [Zbl 0998.68683] \textit{Drewes, Frank; Klempien-Hinrichs, Renate}, TREEBAG, 329-330 [Zbl 0989.68568] \textit{Dvorský, Jiří; Snášel, Václav}, Word random access compression, 331-332 [Zbl 0989.68571] \textit{Gaál, Tamás}, Extended sequentialization of transducers, 333-334 [Zbl 0989.68513] \textit{Johnson, J. Howard}, Lessons from INR in the specification of transductions, 335-336 [Zbl 0989.68552] \textit{Kempe, André}, Part-of-speech tagging with two sequential transducers, 337-339 [Zbl 0989.68556] \textit{Neto, João José}, Solving complex problems efficiently with adaptive automata, 340-342 [Zbl 0989.68563]
0 references
London, Ontario (Canada)
0 references
Papers
0 references
Conference
0 references
CIAA
0 references
Implementation
0 references
Automata
0 references