|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1819 occurrences of 1002 keywords
|
|
|
Results
Found 3512 publication records. Showing 3512 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
82 | 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 |
81 | Xiaolong Shi, Xin Li, Zheng Zhang, Jin Xu |
Improve Capability of DNA Automaton: DNA Automaton with Three Internal States and Tape Head Move in Two Directions.  |
ICIC (2)  |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
Online Construction of Subsequence Automata for Multiple Texts.  |
SPIRE  |
2000 |
DBLP DOI BibTeX RDF |
online construction, subsequence automata, multiple texts, subsequence automaton, minimum automaton, online algorithm, preprocessing, deterministic finite automaton, deterministic automata, alphabet |
74 | Jean-Marc Champarnaud, Djelloul Ziadi |
New Finite Automaton Constructions Based on Canonical Derivatives.  |
CIAA  |
2000 |
DBLP DOI BibTeX RDF |
|
64 | Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge |
Optimal Left-to-Right Pattern-Matching Automata.  |
ALP/HOA  |
1997 |
DBLP DOI BibTeX RDF |
tree automaton, dag automaton, pattern-matching, Term rewriting system |
62 | H. G. Mendelbaum, Raphael B. Yehezkael |
Using 'Parallel Automaton' as a Single Notation to Specify, Design and Control Small Computer Based Systems.  |
ECBS  |
2001 |
DBLP DOI BibTeX RDF |
Extended Automata and Finite state Machines, Parallel Automata, CBS methodology, EFSM |
61 | Liao Zekai, Shu Lan |
Minimization of Lattice Automata.  |
ICFIE  |
2007 |
DBLP DOI BibTeX RDF |
Lattice Automata, Refining Equivalence, Refining Congruence, Quotient Lattice Automata, Minimization |
61 | 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 |
61 | Orna Kupferman, Robby Lampert |
On the Construction of Fine Automata for Safety Properties.  |
ATVA  |
2006 |
DBLP DOI BibTeX RDF |
|
57 | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg |
Subset Seed Automaton.  |
CIAA  |
2007 |
DBLP DOI BibTeX RDF |
subset seed, seed sensitivity, automaton, spaced seed |
56 | A. N. Trahtman |
Piecewise and Local Threshold Testability of DFA.  |
FCT  |
2001 |
DBLP DOI BibTeX RDF |
locally threshold testable, piecewise testable, locally testable, syntactic semigroup, algorithm, automaton, transition graph |
55 | QingE Wu 0001, Tuo Wang, YongXuan Huang, JiSheng Li |
Theory Research on a New Type Fuzzy Automaton.  |
FSKD  |
2006 |
DBLP DOI BibTeX RDF |
|
55 | Ronald L. Rivest, Robert E. Schapire |
Diversity-Based Inference of Finite Automata.  |
J. ACM  |
1994 |
DBLP DOI BibTeX RDF |
diversity-based representation, permutation automata, finite automata, learning theory, inductive inference |
51 | Sylvain Lombardy |
On the Size of the Universal Automaton of a Regular Language.  |
STACS  |
2007 |
DBLP DOI BibTeX RDF |
Universal Automaton, NFA Minimization, Regular languages |
51 | Libor Polák |
Syntactic Semiring and Universal Automaton.  |
Developments in Language Theory  |
2003 |
DBLP DOI BibTeX RDF |
syntactic semiring, universal automaton MSC 2000 Classification: 68Q45 Formal languages and automata |
50 | Maxime Crochemore, Filippo Mignosi, Antonio Restivo |
Minimal Forbidden Words and Factor Automata.  |
MFCS  |
1998 |
DBLP DOI BibTeX RDF |
factorial language, anti-factorial language, factor code, factor automaton, forbidden word, avoiding a word, failure function |
49 | Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi |
Computing the Follow Automaton of an Expression.  |
CIAA  |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Jean-Marc Champarnaud, Djelloul Ziadi |
Computing the Equation Automaton of a Regular Expression in Space and Time.  |
CPM  |
2001 |
DBLP DOI BibTeX RDF |
|
49 | Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen |
Schema-conscious filtering of XML documents.  |
EDBT  |
2009 |
DBLP DOI BibTeX RDF |
|
49 | D. V. Ravindra, Y. N. Srikant |
Improved Preprocessing Methods for Modulo Scheduling Algorithms.  |
HiPC  |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Sylvain Lombardy |
On the Construction of Reversible Automata for Reversible Languages.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
reversible languages, reversible automata, universal automata, Finite automata |
46 | Péter Gács |
Reliable Cellular Automata with Self-Organization.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
noisy cellular automaton, fault-tolerant cellular automaton, probabilistic cellular automata, interacting particle system, Gibbs states, fault tolerance, reliability, cellular automata, cellular automata, self-organization, self organization, error-correction, ergodicity, renormalization |
45 | Kuo-Kun Tseng, Yuan-Cheng Lai, Ying-Dar Lin, Tsern-Huei Lee |
A fast scalable automaton-matching accelerator for embedded content processors.  |
ACM Trans. Embed. Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Aho-Corasick, String matching, Bloom filter, automaton, content filtering |
44 | Avraham Trakhtman |
Reducing the Time Complexity of Testing for Local Threshold Testability.  |
CIAA  |
2003 |
DBLP DOI BibTeX RDF |
threshold locally testable, algorithm, graph, Automaton |
44 | A. N. Trahtman |
A Polynomial Time Algorithm for Left [Right] Local Testability.  |
CIAA  |
2002 |
DBLP DOI BibTeX RDF |
locally testable, algorithm, graph, language, semigroup, deterministic finite automaton |
44 | Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot |
Efficient Experimental String Matching by Weak Factor Recognition.  |
CPM  |
2001 |
DBLP DOI BibTeX RDF |
information retrieval, string matching, algorithm design, Finite automaton |
44 | A. N. Trahtman |
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.  |
WIA  |
1999 |
DBLP DOI BibTeX RDF |
locally threshold testable, semigroup AMS subject classification 68Q25, 68Q68, 20M07, algorithm, deterministic finite automaton, 68Q45 |
42 | Orna Kupferman, Nir Piterman |
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.  |
FoSSaCS  |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Blaise Genest, Anca Muscholl |
Constructing Exponential-Size Deterministic Zielonka Automata.  |
ICALP (2)  |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Tomasz Jurdzinski, Friedrich Otto |
Shrinking Restarting Automata.  |
MFCS  |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Nadia Nedjah, Luiza de Macedo Mourelle |
More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs.  |
CPM  |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Hellis Tamm, Esko Ukkonen |
Bideterministic Automata and Minimal Representations of Regular Languages.  |
CIAA  |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Victor L. Selivanov, Klaus W. Wagner |
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.  |
CiE  |
2008 |
DBLP DOI BibTeX RDF |
Regular aperiodic ?-language, Wadge reducibility, aperiodic automaton, deterministic Muller automaton, nondeterministic Büchi automaton, monadic second-order formula |
40 | Xiaowei Zhang, Yongming Li 0001 |
Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata.  |
Soft Comput.  |
2009 |
DBLP DOI BibTeX RDF |
Intuitionistic fuzzy recognizer, Intuitionistic fuzzy finite automaton, Deterministic intuitionistic fuzzy finite automaton, Intuitionistic fuzzy language |
40 | Friedrich Otto, Heiko Stamer |
Single-Path Restarting Tree Automata.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
restarting tree automaton, single-path top-down tree automaton, classes of tree languages, linear context-free tree language |
40 | B. John Oommen, Jack R. Zgierski |
Breaking Substitution Cyphers Using Stochastic Automata.  |
IEEE Trans. Pattern Anal. Mach. Intell.  |
1993 |
DBLP DOI BibTeX RDF |
substitution cyphers, finite plaintext alphabet, cypher alphabet, unigrams, trigrams, automaton solution, cypher learning automaton, learning, cryptography, learning systems, cardinality, stochastic automata, stochastic automata, statistical information, relaxation theory, relaxation scheme |
39 | Ramón Alonso-Sanz, Margarita Martín |
A Structurally Dynamic Cellular Automaton with Memory in the Hexagonal Tessellation.  |
ACRI  |
2006 |
DBLP DOI BibTeX RDF |
Structurally Dynamic, Memory, Cellular Automaton, Hexagonal |
39 | Richard K. Squier, Kenneth Steiglitz, Mariusz H. Jakubowski |
Implementation of Parallel Arithmetic in a Cellular Automaton.  |
ASAP  |
1995 |
DBLP DOI BibTeX RDF |
particle machine, particle model, parallel arithmetic, cellular automaton |
38 | Christopher H. Broadbent, C.-H. Luke Ong |
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.  |
FoSSaCS  |
2009 |
DBLP DOI BibTeX RDF |
Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme |
38 | Martin De Wulf, Laurent Doyen 0001, Nicolas Markey, Jean-François Raskin |
Robust safety of timed automata.  |
Formal Methods Syst. Des.  |
2008 |
DBLP DOI BibTeX RDF |
Robustness, Implementability, Perturbation, Timed automaton, Drift |
38 | Cong Tian, Zhenhua Duan |
Model Checking Propositional Projection Temporal Logic Based on SPIN.  |
ICFEM  |
2007 |
DBLP DOI BibTeX RDF |
Propositional Projection Temporal Logic, Model Checking, Verification, Spin, Automaton |
38 | Mustapha Bourahla, Mohamed Benmohamed |
Verification of Real-Time Systems by Abstraction of Time Constraints.  |
IPDPS  |
2003 |
DBLP DOI BibTeX RDF |
Real-time systems, Model Checking, Formal Verification, Predicate Abstraction, Timed Automaton |
38 | Abdeslam En-Nouaary, Rachida Dssouli, Ferhat Khendek |
Timed Wp-Method: Testing Real-Time Systems.  |
IEEE Trans. Software Eng.  |
2002 |
DBLP DOI BibTeX RDF |
real-time systems, Testing, specification, implementation, fault coverage, timed automaton |
38 | Jan Heering, Paul Klint, J. Rekers |
Incremental Generation of Lexical Scanners.  |
ACM Trans. Program. Lang. Syst.  |
1992 |
DBLP DOI BibTeX RDF |
lazy and incremental generation of lexical scanners, subset construction, program generator, finite automaton |
37 | Kuo-Kun Tseng, Ying-Dar Lin, Tsern-Huei Lee, Yuan-Cheng Lai |
A Parallel Automaton String Matching with Pre-Hashing and Root-Indexing Techniques for Content Filtering Coprocessor.  |
ASAP  |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Frédéric Gruau, Gabriel Moszkowski |
The Blob Division: A "Hardware-Free", Time Efficient, Self-Reproduction on 2D Cellular Automaton.  |
BioADIT  |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Laura Firoiu, Tim Oates 0001, Paul R. Cohen |
Learning Deterministic Finite Automaton with a Recurrent Neural Network.  |
ICGI  |
1998 |
DBLP DOI BibTeX RDF |
|
36 | Yih-Kuen Tsay, Yu-Fang Chen 0001, Ming-Hsien Tsai 0001, Kang-Nien Wu, Wen-Chin Chan, Chi-Jian Luo, Jinn-Shu Chang |
Tool support for learning Büchi automata and linear temporal logic.  |
Formal Aspects Comput.  |
2009 |
DBLP DOI BibTeX RDF |
Büchi automata, QPTL, Model checking, GOAL, Linear temporal logic |
36 | Marinella Sciortino, Luca Q. Zamboni |
Suffix Automata and Standard Sturmian Words.  |
Developments in Language Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Benjamin Aminof, Orna Kupferman |
On the Succinctness of Nondeterminism.  |
ATVA  |
2006 |
DBLP DOI BibTeX RDF |
|
36 | David Ilcinkas |
Setting Port Numbers for Fast Graph Exploration.  |
SIROCCO  |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Chuanhan Liu, Yongcheng Wang, Derong Liu, Danglin Li |
Two Improved Single Pattern Matching Algorithms.  |
ICAT Workshops  |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Thomas A. Henzinger, Nir Piterman |
Solving Games Without Determinization.  |
CSL  |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Moritz Hammer, Alexander Knapp, Stephan Merz |
Truly On-the-Fly LTL Model Checking.  |
TACAS  |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Feng Bao 0004, Yoshihide Igarashi |
A Randomized Algorithm to Finite Automata Public Key Cryptosystem.  |
ISAAC  |
1994 |
DBLP DOI BibTeX RDF |
|
33 | R. Jiang, Y. M. Yuan, Katsuhiro Nishinari |
On the Approximation Solution of a Cellular Automaton Traffic Flow Model and Its Relationship with Synchronized Flow.  |
Complex (1)  |
2009 |
DBLP DOI BibTeX RDF |
synchronized flow, cellular automaton, traffic flow |
33 | Yang Li, Zheng Li, Nenghai Yu, Ke Ma |
APFA: Asynchronous Parallel Finite Automaton for Deep Packet Inspection in Cloud Computing.  |
CloudCom  |
2009 |
DBLP DOI BibTeX RDF |
Asynchronous parallel finite automaton, Cloud computing, Deep packet inspection |
33 | Weiwei Sun 0008, Yongrui Qin, Ping Yu 0001, Zhuoyao Zhang, Zhenying He |
HFilter: Hybrid Finite Automaton Based Stream Filtering for Deep and Recursive XML Data.  |
DEXA  |
2008 |
DBLP DOI BibTeX RDF |
XML stream filtering, deep and recursive XML data, hybrid finite automaton, data prefix sharing, memory overflow control |
33 | Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne |
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).  |
CIAA  |
2008 |
DBLP DOI BibTeX RDF |
minimal automaton, geometrical language, geometricity test, temporal validation, Finite automata, regular languages |
33 | Dianxun Shuai |
A Novel Network Behavior Model Based on Generalized Cellular Automaton.  |
ICIC (2)  |
2008 |
DBLP DOI BibTeX RDF |
generalized cellular automaton, agent colonies, macroscopic performance, computer networks, dynamical behavior |
33 | Seita Toguchi, Yuhei Akamine, Satoshi Endo |
Research into the Generation of Sound Effects Using a Cellular Automaton.  |
ACRI  |
2008 |
DBLP DOI BibTeX RDF |
sound generation, cellular automaton, physical simulation |
33 | Ireneusz Sierocki |
An Algebraic Transformation of the Minimum Automaton Identification Problem.  |
EUROCAST  |
1993 |
DBLP DOI BibTeX RDF |
simplest hypothesis, identification, congruence, finite automaton |
32 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek |
On the Complexity of 2-Monotone Restarting Automata.  |
Theory Comput. Syst.  |
2008 |
DBLP DOI BibTeX RDF |
Restarting automaton, Growing context-sensitive language, completeness, Monotonicity |
32 | A. N. Trahtman |
Synchronizing Road Coloring.  |
IFIP TCS  |
2008 |
DBLP DOI BibTeX RDF |
road coloring problem, synchronization, graph, deterministic finite automaton |
32 | Gonzalo Navarro 0001, Mathieu Raffinot |
New Techniques for Regular Expression Searching.  |
Algorithmica  |
2005 |
DBLP DOI BibTeX RDF |
Glushkov automaton, Compact DFA representation, BDM, Reverse factors, Bit-parallelism |
32 | Abdullah N. Arslan |
Regular Expression Constrained Sequence Alignment.  |
CPM  |
2005 |
DBLP DOI BibTeX RDF |
dynamic programming, pattern matching, Regular expression, sequence alignment, finite automaton |
32 | Hacène Fouchal, Eric Petitjean, Sébastien Salva |
Testing timed systems with timed purposes.  |
RTCSA  |
2000 |
DBLP DOI BibTeX RDF |
timed systems testing, timed purposes, timed counterpart, timed input/output automaton, canonical tester, protocols, conformance testing, time constraints, labeled transition system, automata theory |
32 | Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot |
Factor Oracle: A New Structure for Pattern Matching.  |
SOFSEM  |
1999 |
DBLP DOI BibTeX RDF |
indexing, pattern matching, algorithm design, finite automaton |
32 | Pascal Poizat, Christine Choppy, Jean-Claude Royer |
Concurrency and Data Types: A Specification Method: An Example with LOTOS.  |
WADT  |
1998 |
DBLP DOI BibTeX RDF |
constraint oriented, state oriented, specification, method, LOTOS, automaton |
32 | Kishore N. Menezes, Sumedh W. Sathaye, Thomas M. Conte |
Path Prediction for High Issue-Rate Processors.  |
IEEE PACT  |
1997 |
DBLP DOI BibTeX RDF |
high issue-rate processors, path prediction, issue bandwidth, multiple branches, path prediction automaton, arbitrary subgraphs, scalability single access prediction, low hardware cost, instruction-level parallelism, pipeline processing, speculative execution, cycle, performance improvement |
32 | Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda |
Cellular automata for deterministic sequential test pattern generation.  |
VTS  |
1997 |
DBLP DOI BibTeX RDF |
deterministic sequential test pattern generation, cellular automaton identification, hardware structure, area occupation, ASIC testing, evolutionary algorithm, cellular automata, BIST, fault coverage, stuck-at faults, FSM, deterministic automata |
31 | Gerardo Perez, Yuridia P. Mejia, Iván Olmos, Jesus A. Gonzalez, Patricia Sánchez, Candelario Vázquez |
An Automaton for Motifs Recognition in DNA Sequences.  |
MICAI  |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Hiroto Sakai, Yusuke Ogura, Jun Tanida |
Positional State Representation and Its Transition Control for Photonic DNA Automaton.  |
DNA  |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Hong Su, Elke A. Rundensteiner, Murali Mani |
Automaton in or out: run-time plan optimization for XML stream processing.  |
SSPS  |
2008 |
DBLP DOI BibTeX RDF |
optimization, XML, stream processing, query rewriting |
31 | Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi |
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression.  |
Developments in Language Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Reza Iraji, M. T. Manzuri-Shalmani, Amir H. Jamalian, Hamid Beigy |
IJA Automaton: Expediency and E-Optimality Properties.  |
IEEE ICCI  |
2006 |
DBLP DOI BibTeX RDF |
|
31 | David Lo 0001, Siau-Cheng Khoo |
QUARK: Empirical Assessment of Automaton-based Specification Miners.  |
WCRE  |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Carlos A. M. Del Carpio, Mohamed Ismael, Eiichiro Ichiishi, Michihisa Koyama, Momoji Kubo, Akira Miyamoto |
An Evolving Automaton for RNA Secondary Structure Prediction.  |
IJCNN  |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Zdenek Tronícek, Ayumi Shinohara |
The Size of Subsequence Automaton.  |
SPIRE  |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Sam M. Kim, Robert McNaughton |
Computing the Order of a Locally Testable Automaton.  |
FSTTCS  |
1991 |
DBLP DOI BibTeX RDF |
|
31 | Danièle Beauquier |
Minimal Automaton of a Rational Cover.  |
ICALP  |
1987 |
DBLP DOI BibTeX RDF |
|
30 | Gabriele Fici |
Combinatorics of Finite Words and Suffix Automata.  |
CAI  |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Akio Fujiyoshi |
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.  |
CIAA  |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Sayan Mitra, Daniel Liberzon, Nancy A. Lynch |
Verifying average dwell time of hybrid systems.  |
ACM Trans. Embed. Comput. Syst.  |
2008 |
DBLP DOI BibTeX RDF |
optimization-based verification, Hybrid systems, simulation relation |
30 | Najla Chamseddine, Marie Duflot, Laurent Fribourg, Claudine Picaronny, Jeremy Sproston |
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata.  |
QEST  |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Amir H. Jamalian, Reza Iraji, A. R. Sefidpour, M. T. Manzuri-Shalmani |
Examining the epsilon-Optimality Property of a Tunable FSSA.  |
IEEE ICCI  |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Laura Giordano 0001, Alberto Martelli |
Tableau-based automata construction for dynamic linear time temporal logic*.  |
Ann. Math. Artif. Intell.  |
2006 |
DBLP DOI BibTeX RDF |
AMS subject classification 03B44, 68N30 |
30 | Bingsheng He, Qiong Luo 0001, Byron Choi |
Cache-Conscious Automata for XML Filtering.  |
IEEE Trans. Knowl. Data Eng.  |
2006 |
DBLP DOI BibTeX RDF |
Cache-conscious, XML filtering, cache behavior model, query processing, automata, buffer |
30 | 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 |
|
30 | Nicolae Galupa |
Variable SYNC Signal Definition for Automata Performance Improvment.  |
CCECE  |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Bingsheng He, Qiong Luo 0001, Byron Choi |
Cache-Conscious Automata for XML Filtering.  |
ICDE  |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Laura Giordano 0001, Alberto Martelli |
On-the-Fly Automata Construction for Dynamic Linear Time Temporal Logic.  |
TIME  |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Tapio Elomaa |
Partition-Refining Algorithms for Learning Finite State Automata.  |
ISMIS  |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Erzsébet Csuhaj-Varjú, György Vaszil |
P Automata or Purely Communicating Accepting P Systems.  |
WMC-CdeA  |
2002 |
DBLP DOI BibTeX RDF |
|
30 | Paul Gastin, Denis Oddoux |
Fast LTL to Büchi Automata Translation.  |
CAV  |
2001 |
DBLP DOI BibTeX RDF |
|
30 | Alberto Apostolico, Gill Bejerano |
Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space.  |
RECOMB  |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Tomasz Fryderyk Urbanski |
On Deciding if Deterministic Rabin Language Is in Büchi Class.  |
ICALP  |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan |
A Package for the Implementation of Block Codes as Finite Automata.  |
CIAA  |
2000 |
DBLP DOI BibTeX RDF |
minimal trellis, decoder complexity, subtrellis overlaying, block codes |
30 | Ricardo A. Baeza-Yates, Gonzalo Navarro 0001 |
Faster Approximate String Matching.  |
Algorithmica  |
1999 |
DBLP DOI BibTeX RDF |
Text searching allowing errors, Bit-parallelism |
30 | Edmund M. Clarke, Anca Browne, Robert P. Kurshan |
A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata.  |
CAAP  |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3512 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|