default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th CIAA 2011: Blois, France
- Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel:
Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings. Lecture Notes in Computer Science 6807, Springer 2011, ISBN 978-3-642-22255-9
Invited Lectures
- Sheng Yu:
Derick Wood: Always in Our Hearts. 1-2 - Olivier Gauwin, Joachim Niehren:
Streamable Fragments of Forward XPath. 3-15 - Markus Holzer
, Martin Kutrib:
Gaining Power by Input Operations: Finite Automata and Beyond. 16-29
Technical Contributions
- Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty:
Weak Inclusion for XML Types. 30-41 - Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. 42-52 - Erez Buchnik:
Bouma2 - A High-Performance Input-Aware Multiple String-Match Algorithm. 53-64 - Vincent Carnino, Sven De Felice:
Random Generation of Deterministic Acyclic Automata Using Markov Chains. 65-75 - José M. Castaño, Rodrigo Castaño:
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability. 76-87 - Giusi Castiglione, Antonio Restivo, Marinella Sciortino:
Nondeterministic Moore Automata and Brzozowski's Algorithm. 88-99 - Supaporn Chairungsee, Maxime Crochemore:
Building Phylogeny with Minimal Absent Words. 100-109 - Chih-Hong Cheng, Barbara Jobstmann, Christian Buckl, Alois C. Knoll:
On the Hardness of Priority Synthesis. 110-117 - Jan Daciuk, Dawid Weiss:
Smaller Representation of Finite State Automata. 118-129 - Ingo Felscher, Wolfgang Thomas:
Compositional Failure Detection in Structured Transition Systems. 130-141 - Pawel Gawrychowski:
Chrobak Normal Form Revisited, with Applications. 142-153 - Yo-Sub Han, Sang-Ki Ko:
A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule. 154-165 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
Loops and Overloops for Tree Walking Automata. 166-177 - Markus Holzer, Martin Kutrib, Katja Meckel:
Nondeterministic State Complexity of Star-Free Languages. 178-189 - Oscar H. Ibarra:
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs. 190-202 - Artur Jez, Andreas Maletti:
Computing All ℓ-Cover Automata Fast. 203-214 - Natalia Kushik, Khaled El-Fakih, Nina Yevtushenko:
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines. 215-224 - Violetta Lonati, Matteo Pradella:
Towards More Expressive 2D Deterministic Automata. 225-237 - Pavel Martyugin:
Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata. 238-249 - James Jerson Ortiz, Axel Legay, Pierre-Yves Schobbens:
Distributed Event Clock Automata - Extended Abstract. 250-263
Short Papers
- Bruno Courcelle, Irène Durand:
Fly-Automata, Their Properties and Applications. 264-272 - Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. 273-281 - Vesna Pajic, Gordana Pavlovic-Lazetic, Milos Pajic:
Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach. 282-289 - Evgeny Skvortsov, Evgeny Tipikin:
Experimental Study of the Shortest Reset Word of Random Automata. 290-298
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-03-01 15:00 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:
