Search results for "CIAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Egor Dolzhenko, Natasa Jonoska	On Complexity of Two Dimensional Languages Generated by Transducers.	CIAA	2008	DBLP DOI BibTeX RDF	Finite State Automata with Output, Local Languages, Entropy, Transducers, Picture Languages
1	Martin Simunek, Borivoj Melichar	Approximate Periods with Levenshtein Distance.	CIAA	2008	DBLP DOI BibTeX RDF
1	Natasa Jonoska, Joni Burnette Pirnot	Finite State Automata Representing Two-Dimensional Subshifts.	CIAA	2007	DBLP DOI BibTeX RDF	two-dimensional subshift, transitivity, periodicity
1	Johanna Högberg, Andreas Maletti, Jonathan May	Backward and Forward Bisimulation Minimisation of Tree Automata.	CIAA	2007	DBLP DOI BibTeX RDF	natural language processing, bisimulation, minimisation, tree automata
1	Joachim Klein 0001, Christel Baier	On-the-Fly Stuttering in the Construction of Deterministic omega -Automata.	CIAA	2007	DBLP DOI BibTeX RDF	Rabin, ?-automaton, determinization, LTL, deterministic, stuttering
1	Magnus Steinby, Catalin Ionut Tîrnauca	Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms.	CIAA	2007	DBLP DOI BibTeX RDF	tree bimorphisms, natural language processing, syntax-directed translations, regular tree languages
1	Anssi Yli-Jyrä, Kimmo Koskenniemi	A New Method for Compiling Parallel Replacement Rules.	CIAA	2007	DBLP DOI BibTeX RDF	regular relations, conditional replacement, two-level rules, finite-state compilation
1	Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner	The Constrained Longest Common Subsequence Problem for Degenerate Strings.	CIAA	2007	DBLP DOI BibTeX RDF
1	Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada	An Implementation of Deterministic Tree Automata Minimization.	CIAA	2007	DBLP DOI BibTeX RDF	sminimal deterministic tree automata, minimization of automata
1	Mehryar Mohri, Pedro J. Moreno 0001, Eugene Weinstein	Factor Automata of Automata and Applications.	CIAA	2007	DBLP DOI BibTeX RDF	suffix automata, factor automata, music identification, information retrieval, finite automata, suffix trees, inverted files, text indexing
1	Jan Holub 0001, Jan Zdárek (eds.)	Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers	CIAA	2007	DBLP DOI BibTeX RDF
1	Claus Brabrand, Robert Giegerich, Anders Møller	Analyzing Ambiguity of Context-Free Grammars.	CIAA	2007	DBLP DOI BibTeX RDF	CFG ambiguity, regular approximation, RNA analysis
1	Jean-Marc Champarnaud, Franck Guingne, Jacques Farré	Reducing Acyclic Cover Transducers.	CIAA	2007	DBLP DOI BibTeX RDF	subsequential transducer, cover transducer for a finite subsequential function, finite state transducer, state reduction
1	Massimiliano Goldwurm, Roberto Radicioni	Average Value and Variance of Pattern Statistics in Rational Models.	CIAA	2007	DBLP DOI BibTeX RDF	pattern statistics, rational formal series, bioinformatics, Markov chains
1	Manfred Droste, George Rahonis	Weighted Automata and Weighted Logics with Discounting.	CIAA	2007	DBLP DOI BibTeX RDF	weighted Büchi and Muller automata, weighted MSO logic, discounting, formal power series, weighted automata
1	Michael Holtmann, Christof Löding	Memory Reduction for Strategies in Infinite Games.	CIAA	2007	DBLP DOI BibTeX RDF	request-response game, Staiger-Wagner game, Büchi, DWA, GASt, reduction, strategy, automaton, attractor, infinite games, memory reduction
1	Martin Kutrib, Andreas Malcher, Larissa Werlein	Regulated Nondeterminism in Pushdown Automata.	CIAA	2007	DBLP DOI BibTeX RDF	regulated nondeterminism, limited nondeterminism, pushdown automata, closure properties
1	Jan Supol	Significant Subpatterns Matching.	CIAA	2007	DBLP DOI BibTeX RDF
1	Bruce W. Watson	Automata Applications in Chip-Design Software.	CIAA	2007	DBLP DOI BibTeX RDF	design rule checking, pattern matching, EDA, integrated circuit layout, chip design
1	Frantisek Mráz, Martin Plátek, Friedrich Otto	A Measure for the Degree of Nondeterminism of Context-Free Languages.	CIAA	2007	DBLP DOI BibTeX RDF	measure of nondeterminism, restarting automaton, analysis by reduction
1	Frédérique Bassino, Julien David, Cyril Nicaud	: A Library to Randomly and Exhaustively Generate Automata.	CIAA	2007	DBLP DOI BibTeX RDF	C++ library, finite automata, random generation
1	François Barthélemy	Multi-grain Relations.	CIAA	2007	DBLP DOI BibTeX RDF	rational relation, tree transduction, two-level morphology
1	Gheorghe Paun	Spiking Neural P Systems Used as Acceptors and Transducers.	CIAA	2007	DBLP DOI BibTeX RDF	string processing, membrane computing, Turing computability, spiking neural P system
1	Hannu Peltola, Jorma Tarhio	On String Matching in Chunked Texts.	CIAA	2007	DBLP DOI BibTeX RDF	Horspool algorithm, string matching, experimental comparison
1	Kai Salomaa, Sheng Yu 0001, Jinfeng Zan	Deterministic Caterpillar Expressions.	CIAA	2007	DBLP DOI BibTeX RDF	tree walking automata, decidability, regular expressions, determinism
1	Mikhail V. Volkov 0001	Synchronizing Automata Preserving a Chain of Partial Orders.	CIAA	2007	DBLP DOI BibTeX RDF	synchronizing automaton, ?erný conjecture, congruence on an automaton, weakly monotonic automaton, strongly connected automaton, deterministic finite automaton
1	Marcella Anselmo, Dora Giammarresi, Maria Madonia	Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.	CIAA	2007	DBLP DOI BibTeX RDF	automata, determinism, two-dimensional languages
1	Barbara Klunder	Finite Automata Accepting Star-Connected Languages.	CIAA	2007	DBLP DOI BibTeX RDF	trace monoid, star-connected language, finite automaton
1	Clemens Marschner	Efficiently Matching with Local Grammars Using Prefix Overlay Transducers.	CIAA	2007	DBLP DOI BibTeX RDF
1	Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg	Subset Seed Automaton.	CIAA	2007	DBLP DOI BibTeX RDF	subset seed, seed sensitivity, automaton, spaced seed
1	Margareta Ackerman, Jeffrey O. Shallit	Efficient Enumeration of Regular Languages.	CIAA	2007	DBLP DOI BibTeX RDF	nondeterministic finite automaton, radix order, enumeration, regular language, lexicographical order
1	Shmuel Tomi Klein, Miri Ben-Nissan	Accelerating Boyer Moore Searches on Binary Texts.	CIAA	2007	DBLP DOI BibTeX RDF	Boyer-Moore, BDM, binary texts, compressed matching, pattern matching
1	Maxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi	On the Suffix Automaton with Mismatches.	CIAA	2007	DBLP DOI BibTeX RDF	suffix automata, languages with mismatches, approximate string matching, combinatorics on words
1	Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter	Efficient Computation of Throughput Values of Context-Free Languages.	CIAA	2007	DBLP DOI BibTeX RDF	push-down automaton, minimal mean weight, throughput, context-free grammar
1	Cyril Allauzen, Michael Riley 0001, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri	OpenFst: A General and Efficient Weighted Finite-State Transducer Library.	CIAA	2007	DBLP DOI BibTeX RDF	rational power series, finite-state transducers, weighted automata
1	Moshe Y. Vardi	Linear-Time Model Checking: Automata Theory in Practice.	CIAA	2007	DBLP DOI BibTeX RDF	Büchi automata, model checking, linear-temporal logic
1	Olivier Blanc, Matthieu Constant, Patrick Watrin	A Finite-State Super-Chunker.	CIAA	2007	DBLP DOI BibTeX RDF	multiword units, super-chunking, natural language processing, lexical resources, local grammar
1	Hing Leung	Structurally Unambiguous Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Jacques Farré, Igor Litovsky, Sylvain Schmitz (eds.)	Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers	CIAA	2006	DBLP DOI BibTeX RDF
1	Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng	On-the-Fly Branching Bisimulation Minimization for Compositional Analysis.	CIAA	2006	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg	Bisimulation Minimization of Tree Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Manuel Baclet, Claire Pagetti	Around Hopcroft's Algorithm.	CIAA	2006	DBLP DOI BibTeX RDF	Hopcroft’s algorithm, Finite automata, minimization
1	Martin Simunek, Borivoj Melichar	Borders and Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Michael Luttenberger	Reachability Analysis of Procedural Programs with Affine Integer Arithmetic.	CIAA	2006	DBLP DOI BibTeX RDF
1	Grzegorz Rozenberg	Theory Inspired by Gene Assembly in Ciliates.	CIAA	2006	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Joseph Le Roux, Guy Perrier	Lexical Disambiguation with Polarities and Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Ruhsan Onder, Zeki Bayram	XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof.	CIAA	2006	DBLP DOI BibTeX RDF
1	Matthieu Constant, Denis Maurel	Compiling Linguistic Constraints into Finite State Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	José Fortes Gálvez, Sylvain Schmitz, Jacques Farré	Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time.	CIAA	2006	DBLP DOI BibTeX RDF
1	Sheng Yu 0001	On the State Complexity of Combined Operations.	CIAA	2006	DBLP DOI BibTeX RDF
1	Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe	Multi-tape Automata with Symbol Classes.	CIAA	2006	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi	Factor Oracles.	CIAA	2006	DBLP DOI BibTeX RDF	factor oracle, suffix trie, graph quotient, string matching, suffix tree
1	Andreas Maletti	Does o-Substitution Preserve Recognizability?	CIAA	2006	DBLP DOI BibTeX RDF
1	Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter	Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.	CIAA	2006	DBLP DOI BibTeX RDF
1	Guowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski	Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits.	CIAA	2006	DBLP DOI BibTeX RDF
1	Pavlos Antoniou, Jan Holub 0001, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo	Finding Common Motifs with Gaps Using Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Manuel Vazquez de Parga, Pedro García 0001, José Ruiz 0001	A Family of Algorithms for Non Deterministic Regular Languages Inference.	CIAA	2006	DBLP DOI BibTeX RDF
1	Henning Bordihn, Markus Holzer 0001, Martin Kutrib	Hybrid Extended Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Suman Roy 0001, Bhaskar Chakraborty	A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems.	CIAA	2006	DBLP DOI BibTeX RDF
1	Adrian D. Thurston	Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression.	CIAA	2006	DBLP DOI BibTeX RDF
1	Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini	Symbolic Implementation of Alternating Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Tim Fernando	Finite-State Temporal Projection.	CIAA	2006	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Hsu-Chun Yen (eds.)	Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings	CIAA	2006	DBLP DOI BibTeX RDF
1	Ming Li 0001	Information Distance and Its Applications.	CIAA	2006	DBLP DOI BibTeX RDF
1	Heikki Hyyrö	Tighter Packed Bit-Parallel NFA for Approximate String Matching.	CIAA	2006	DBLP DOI BibTeX RDF
1	Jonathan May, Kevin Knight	Tiburon: A Weighted Tree Automata Toolkit.	CIAA	2006	DBLP DOI BibTeX RDF
1	Jens Glöckler	Forgetting Automata and Unary Languages.	CIAA	2006	DBLP DOI BibTeX RDF
1	Corinna Cortes, Mehryar Mohri, Ashish Rastogi	On the Computation of Some Standard Distances Between Probabilistic Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	German Tischler	Refinement of Near Random Access Video Coding with Weighted Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek	Correctness Preservation and Complexity of Simple RL-Automata.	CIAA	2006	DBLP DOI BibTeX RDF
1	Mathieu Giraud, Philippe Veber, Dominique Lavenier	Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton.	CIAA	2006	DBLP DOI BibTeX RDF
1	André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart	A Class of Rational n-WFSM Auto-intersections.	CIAA	2005	DBLP DOI BibTeX RDF
1	Miklós Bartha	Strong Retiming Equivalence of Synchronous Schemes.	CIAA	2005	DBLP DOI BibTeX RDF
1	Akio Fujiyoshi, Ikuo Kawaharada	Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton.	CIAA	2005	DBLP DOI BibTeX RDF
1	Johanna Högberg	Wind in the Willows - Generating Music by Means of Tree Transducers.	CIAA	2005	DBLP DOI BibTeX RDF
1	Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier	Observations on Determinization of Büchi Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Cezar Câmpeanu, Andrei Paun, Jason R. Smith 0002	An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Colin de la Higuera, Frédéric Piat, Frédéric Tantini	Learning Stochastic Finite Automata for Musical Style Recognition.	CIAA	2005	DBLP DOI BibTeX RDF
1	Rimma I. Podlovchenko, Dmitry M. Rusakov, Vladimir A. Zakharov	On the Equivalence Problem for Programs with Mode Switching.	CIAA	2005	DBLP DOI BibTeX RDF
1	Hariharan Subramanian, Priti Shankar	Compressing XML Documents Using Recursive Finite State Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Michael Vielhaber 0001, Mónica del Pilar Canales Chacon	On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set.	CIAA	2005	DBLP DOI BibTeX RDF
1	Arnaud Bailly, Mireille Clerbout, Isabelle Simplot-Ryl	Component Composition Preserving Behavioural Contracts Based on Communication Traces.	CIAA	2005	DBLP DOI BibTeX RDF
1	Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter	Prime Normal Form and Equivalence of Simple Grammars.	CIAA	2005	DBLP DOI BibTeX RDF
1	Rusins Freivalds	Languages Recognizable by Quantum Finite Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson	Minimization of Non-deterministic Automata with Large Alphabets.	CIAA	2005	DBLP DOI BibTeX RDF
1	Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch	Inside Vaucanson.	CIAA	2005	DBLP DOI BibTeX RDF
1	Pedro García 0001, José Ruiz 0001, Antonio Cano, Gloria Inés Alvarez	Is Learning RFSAs Better Than Learning DFAs?.	CIAA	2005	DBLP DOI BibTeX RDF
1	Isabelle Tellier	Automata and AB-Categorial Grammars.	CIAA	2005	DBLP DOI BibTeX RDF
1	Tadahiro Suda, Haruo Hosoya	Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment.	CIAA	2005	DBLP DOI BibTeX RDF
1	Tomasz Jurdzinski, Friedrich Otto	Restricting the Use of Auxiliary Symbols for Restarting Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Louis Latour	Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams.	CIAA	2005	DBLP DOI BibTeX RDF
1	Jan Daciuk, Denis Maurel, Agata Savary	Incremental and Semi-incremental Construction of Pseudo-Minimal Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Yo-Sub Han, Derick Wood	Shorter Regular Expressions from Finite-State Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Wojciech Rytter	The Structure of Subword Graphs and Suffix Trees of Fibonacci Words.	CIAA	2005	DBLP DOI BibTeX RDF
1	Jan Zdárek, Borivoj Melichar	On Two-Dimensional Pattern Matching by Finite Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Miklós Krész	Simulation of Soliton Circuits.	CIAA	2005	DBLP DOI BibTeX RDF
1	Radek Pelánek, Jan Strejcek	Deeper Connections Between LTL and Alternating Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Manuel Vilares Ferro, Juan Otero Pombo, Jesús Vilares Ferro	Robust Spelling Correction.	CIAA	2005	DBLP DOI BibTeX RDF
1	Hellis Tamm, Matti Nykänen, Esko Ukkonen	Size Reduction of Multitape Automata.	CIAA	2005	DBLP DOI BibTeX RDF
1	Tamara Shcherbak	The Interval Rank of Monotonic Automata.	CIAA	2005	DBLP DOI BibTeX RDF

Publications at "CIAA"( http://dblp.L3S.de/Venues/CIAA )