|
Conferences in DBLP
- Gheorghe Paun
Spiking Neural P Systems Used as Acceptors and Transducers. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:1-4 [Conf]
- Moshe Y. Vardi
Linear-Time Model Checking: Automata Theory in Practice. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:5-10 [Conf]
- Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri
OpenFst: A General and Efficient Weighted Finite-State Transducer Library. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:11-23 [Conf]
- Bruce W. Watson
Automata Applications in Chip-Design Software. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:24-26 [Conf]
- Mikhail V. Volkov
Synchronizing Automata Preserving a Chain of Partial Orders. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:27-37 [Conf]
- Jean-Marc Champarnaud, Franck Guingne, Jacques Farré
Reducing Acyclic Cover Transducers. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:38-50 [Conf]
- Joachim Klein, Christel Baier
On-the-Fly Stuttering in the Construction of Deterministic omega -Automata. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:51-61 [Conf]
- Massimiliano Goldwurm, Roberto Radicioni
Average Value and Variance of Pattern Statistics in Rational Models. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:62-72 [Conf]
- Manfred Droste, George Rahonis
Weighted Automata and Weighted Logics with Discounting. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:73-84 [Conf]
- Martin Kutrib, Andreas Malcher, Larissa Werlein
Regulated Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:85-96 [Conf]
- Kai Salomaa, Sheng Yu, Jinfeng Zan
Deterministic Caterpillar Expressions. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:97-108 [Conf]
- Johanna Högberg, Andreas Maletti, Jonathan May
Backward and Forward Bisimulation Minimisation of Tree Automata. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:109-121 [Conf]
- Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
An Implementation of Deterministic Tree Automata Minimization. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:122-129 [Conf]
- Shmuel Tomi Klein, Miri Ben-Nissan
Accelerating Boyer Moore Searches on Binary Texts. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:130-143 [Conf]
- Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi
On the Suffix Automaton with Mismatches. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:144-156 [Conf]
- Hannu Peltola, Jorma Tarhio
On String Matching in Chunked Texts. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:157-167 [Conf]
- Mehryar Mohri, Pedro Moreno, Eugene Weinstein
Factor Automata of Automata and Applications. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:168-179 [Conf]
- Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
Subset Seed Automaton. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:180-191 [Conf]
- Frantisek Mráz, Martin Plátek, Friedrich Otto
A Measure for the Degree of Nondeterminism of Context-Free Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:192-202 [Conf]
- Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Efficient Computation of Throughput Values of Context-Free Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:203-213 [Conf]
- Claus Brabrand, Robert Giegerich, Anders Møller
Analyzing Ambiguity of Context-Free Grammars. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:214-225 [Conf]
- Margareta Ackerman, Jeffrey Shallit
Efficient Enumeration of Regular Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:226-242 [Conf]
- François Barthélemy
Multi-grain Relations. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:243-252 [Conf]
- Michael Holtmann, Christof Löding
Memory Reduction for Strategies in Infinite Games. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:253-264 [Conf]
- Magnus Steinby, Catalin Ionut Tîrnauca
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:265-276 [Conf]
- Natasa Jonoska, Joni Burnette Pirnot
Finite State Automata Representing Two-Dimensional Subshifts. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:277-289 [Conf]
- Marcella Anselmo, Dora Giammarresi, Maria Madonia
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:290-302 [Conf]
- Frédérique Bassino, Julien David, Cyril Nicaud
: A Library to Randomly and Exhaustively Generate Automata. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:303-305 [Conf]
- Olivier Blanc, Matthieu Constant, Patrick Watrin
A Finite-State Super-Chunker. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:306-308 [Conf]
- Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
The Constrained Longest Common Subsequence Problem for Degenerate Strings. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:309-311 [Conf]
- Barbara Klunder
Finite Automata Accepting Star-Connected Languages. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:312-313 [Conf]
- Clemens Marschner
Efficiently Matching with Local Grammars Using Prefix Overlay Transducers. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:314-316 [Conf]
- Jan Supol
Significant Subpatterns Matching. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:317-319 [Conf]
- Anssi Yli-Jyrä, Kimmo Koskenniemi
A New Method for Compiling Parallel Replacement Rules. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:320-321 [Conf]
|