×

zbMATH — the first resource for mathematics

Implementation and application of automata. 10th international conference, CIAA 2005, Sophia Antipolis, France, June 27–29, 2005. Revised selected papers. (English) Zbl 1097.68004
Lecture Notes in Computer Science 3845. Berlin: Springer (ISBN 3-540-31023-1/pbk). xiii, 360 p. (2006).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1063.68004).
Indexed articles:
Freivalds, Rūsiņš, Languages recognizable by quantum finite automata, 1-14 [Zbl 1172.68505]
Sakarovitch, Jacques, The language, the expression, and the (small) automaton, 15-30 [Zbl 1172.68526]
Abdulla, Parosh Aziz; Deneux, Johann; Kaati, Lisa; Nilsson, Marcus, Minimization of non-deterministic automata with large alphabets, 31-42 [Zbl 1172.68488]
Anselmo, Marcella; Madonia, Maria, Simulating two-dimensional recognizability by pushdown and queue automata, 43-53 [Zbl 1172.68491]
Bailly, Arnaud; Clerbout, Mireille; Simplot-Ryl, Isabelle, Component composition preserving behavioural contracts based on communication traces, 54-65 [Zbl 1172.68421]
Bartha, Miklós, Strong retiming equivalence of synchronous schemes, 66-77 [Zbl 1172.68476]
Bastien, Cédric; Czyzowicz, Jurek; Fraczak, Wojciech; Rytter, Wojciech, Prime normal form and equivalence of simple grammars, 78-89 [Zbl 1172.68483]
Câmpeanu, Cezar; Păun, Andrei; Smith, Jason R., An incremental algorithm for constructing minimal deterministic finite cover automata, 90-103 [Zbl 1172.68494]
Cano, Antonio; García, Pedro, Finite automata and unions of regular patterns with bounded constant segments, 104-115 [Zbl 1172.68495]
Claveirole, Thomas; Lombardy, Sylvain; O’Connor, Sarah; Pouchet, Louis-Noël; Sakarovitch, Jacques, Inside Vaucanson, 116-128 [Zbl 1172.68498]
Fujiyoshi, Akio; Kawaharada, Ikuo, Deterministic recognition of trees accepted by a linear pushdown tree automaton, 129-140 [Zbl 1172.68506]
Han, Yo-Sub; Wood, Derick, Shorter regular expressions from finite-state automata, 141-152 [Zbl 1172.68509]
Högberg, Johanna, Wind in the willows – generating music by means of tree transducers, 153-162 [Zbl 1172.68510]
Ibarra, Oscar H.; Yen, Hsu-Chun, On deterministic catalytic systems, 163-175 [Zbl 1172.68473]
Jurdziński, Tomasz; Otto, Friedrich, Restricting the use of auxiliary symbols for restarting automata, 176-187 [Zbl 1172.68513]
Kempe, André; Champarnaud, Jean-Marc; Eisner, Jason; Guingne, Franck; Nicart, Florent, A class of rational \(n\)-WFSM auto-intersections, 188-198 [Zbl 1172.68474]
Klein, Joachim; Baier, Christel, Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic, 199-212 [Zbl 1172.68514]
Latour, Louis, Computing affine hulls over \(\mathbb Q\) and \(\mathbb Z\) from sets represented by number decision diagrams, 213-224 [Zbl 1172.68516]
Lohrey, Markus; Maneth, Sebastian, Tree automata and XPath on compressed trees, 225-237 [Zbl 1172.68517]
Pelánek, Radek; Strejček, Jan, Deeper connections between LTL and alternating automata, 238-249 [Zbl 1172.68523]
Rytter, Wojciech, The structure of subword graphs and suffix trees of Fibonacci words, 250-261 [Zbl 1172.68566]
Althoff, Christoph Schulte; Thomas, Wolfgang; Wallmeier, Nico, Observations on determinization of Büchi automata, 262-272 [Zbl 1172.68490]
Shcherbak, Tamara, The interval rank of monotonic automata, 273-281 [Zbl 1172.68528]
Subramanian, Hariharan; Shankar, Priti, Compressing XML documents using recursive finite state automata, 282-293 [Zbl 1172.68471]
Suda, Tadahiro; Hosoya, Haruo, Non-backtracking top-down algorithm for checking tree automata containment, 294-306 [Zbl 1172.68529]
Tamm, Hellis; Nykänen, Matti; Ukkonen, Esko, Size reduction of multitape automata, 307-318 [Zbl 1172.68530]
Vilares, Manuel; Otero, Juan; Vilares, Jesús, Robust spelling correction, 319-328 [Zbl 1172.68635]
Žd’árek, Jan; Melichar, Bořivoj, On two-dimensional pattern matching by finite automata, 329-340 [Zbl 1172.68665]
Daciuk, Jan; Maurel, Denis; Savary, Agata, Incremental and semi-incremental construction of pseudo-minimal automata, 341-342 [Zbl 1172.68500]
García, Pedro; Ruiz, José; Cano, Antonio; Alvarez, Gloria, Is learning RFSAs better than learning DFAs?, 343-344 [Zbl 1172.68507]
de la Higuera, Colin; Piat, Frédéric; Tantini, Frédéric, Learning stochastic finite automata for musical style recognition, 345-346 [Zbl 1172.68534]
Krész, Miklós, Simulation of soliton circuits, 347-348 [Zbl 1172.68515]
Morais, José João; Moreira, Nelma; Reis, Rogério, Acyclic automata with easy-to-find short regular expressions, 349-350 [Zbl 1172.68520]
Podlovchenko, Rimma I.; Rusakov, Dmitry M.; Zakharov, Vladimir A., On the equivalence problem for programs with mode switching, 351-352 [Zbl 1172.68424]
Tellier, Isabelle, Automata and AB-categorial grammars, 353-355 [Zbl 1172.03319]
Vielhaber, Michael; del Pilar Canales Ch., Mónica, On a class of bijective binary transducers with finitary description despite infinite state set, 356-357 [Zbl 1172.68532]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q45 Formal languages and automata
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI