|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 823 occurrences of 477 keywords
|
|
|
Results
Found 2071 publication records. Showing 2071 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
69 | Zhe Dang, Oscar H. Ibarra, Jianwen Su |
Composability of Infinite-State Activity Automata. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
68 | Howard Straubing, Denis Thérien |
Finite automata and computational complexity. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
68 | Juraj Hromkovic, Georg Schnitger |
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
descriptional complexity of regular languages, Finite automata, nondeterminism |
65 | Helmut Jürgensen, Ludwig Staiger |
Finite Automata Encoding Geometric Figures. |
WIA |
1999 |
DBLP DOI BibTeX RDF |
|
65 | Rusins Freivalds |
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
63 | Chandra M. R. Kintala, Detlef Wotschke |
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
60 | Randy Smith, Cristian Estan, Somesh Jha |
XFA: Faster Signature Matching with Extended Automata. |
SP |
2008 |
DBLP DOI BibTeX RDF |
intrusion detection, regular expressions, finite automata, signature matching |
56 | Andris Ambainis, Ashwin Nayak 0001, Amnon Ta-Shma, Umesh V. Vazirani |
Dense quantum coding and quantum finite automata. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Automaton size, quantum computation, encoding, communication complexity, finite automata, quantum communication |
55 | Ville Laurikari |
NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions. |
SPIRE |
2000 |
DBLP DOI BibTeX RDF |
tagged transitions, automata conversion, input string position tracking, last-use tracking, nondeterministic Mealy machines, string processing, substring addressing, lookahead operator, regular expressions, finite automata, formal semantics, deterministic automata, nondeterministic finite automata |
54 | Bernard Boigelot, Julien Brusten, Véronique Bruyère |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. |
ICALP (2) |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
Measures of Nondeterminism in Finite Automata. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
limited ambiguity, communication complexity, finite automata, nondeterminism, descriptional complexity |
53 | Rusins Freivalds |
Hamming, Permutations and Automata. |
SAGA |
2007 |
DBLP DOI BibTeX RDF |
|
53 | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski |
Quantum Finite Multitape Automata. |
SOFSEM |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Andris Ambainis |
The Complexity of Probabilistic versus Deterministic Finite Automata. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
the complexity of finite automata, probabilistic finite automata, Automata theory |
52 | Borivoj Melichar, Jan Skryja |
On the Size of Deterministic Finite Automata. |
CIAA |
2001 |
DBLP DOI BibTeX RDF |
|
51 | Jean-Camille Birget |
Basic techniques for two-way finite automata. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Kosaburo Hashiguchi |
Relative star height, star height and finite automata with distance functions. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
51 | Jean Berstel |
Finite automata and rational languages. An introduction. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
50 | Wolfgang Thomas |
Automata and quantifier hierarchies. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
49 | Lynette van Zijl |
Supernondeterministic Finite Automata. |
CIAA |
2001 |
DBLP DOI BibTeX RDF |
|
49 | 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 |
49 | Salvatore La Torre, Aniello Murano, Margherita Napoli |
Weak Muller Acceptance Conditions for Tree Automata. |
VMCAI |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Junna Kuramochi, Yasubumi Sakakibara |
Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube. |
DNA |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Andris Ambainis, Rusins Freivalds |
1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
quantum computation, finite automata |
45 | Colin de la Higuera |
Learning Stochastic Finite Automata from Experts. |
ICGI |
1998 |
DBLP DOI BibTeX RDF |
identification with probability one, polynomial learning, stochastic deterministic finite automata, grammatical inference |
45 | Markus Holzer 0001, Martin Kutrib |
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. |
CIAA |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Randy Smith, Cristian Estan, Somesh Jha, Ida Sri Rejeki Siahaan |
Fast Signature Matching Using Extended Finite Automaton (XFA). |
ICISS |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens |
The Regular Real-Time Languages. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Sam M. Kim, Robert McNaughton, Robert McCloskey |
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. |
IEEE Trans. Computers |
1991 |
DBLP DOI BibTeX RDF |
local testability, locally testable language, nonnegative integer, prefix, suffix, computational complexity, polynomial time algorithm, formal languages, finite automata, word, deterministic finite automata, deterministic automata, substrings |
43 | Thomas L. Casavant, Jon G. Kuhl |
A Communicating Finite Automata Approach to Modeling Distributed Computation and Its Application to Distributed Decision-Making. |
IEEE Trans. Computers |
1990 |
DBLP DOI BibTeX RDF |
communicating finite automata approach, standard specification mechanism, distribution scheduling algorithms, scheduling, modeling, formal specification, distributed computation, directed graphs, directed graphs, finite automata, distributed decision-making |
43 | Hanlin Lu, Sheng Yu 0001 |
Are Statecharts Finite Automata? |
CIAA |
2009 |
DBLP DOI BibTeX RDF |
interaction machines, statecharts, finite automata |
42 | Attila Kondacs, John Watrous |
On the Power of Quantum Finite State Automata. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
quantum finite state automata, non-regular language, finite automata, finite state automata, regular languages |
42 | Suna Bensch, Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Deterministic Input-Reversal and Input-Revolving Finite Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Xian Xu 0001 |
P Systems and Finite Automata. |
CISIS |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Andreas Malcher |
Minimizing Finite Automata Is Computationally Hard. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Andrei Paun, Mihaela Paun |
State and Transition Complexity of Watson-Crick Finite Automata. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
42 | Chenguang Luo |
From Word Automata to Tree Automata. |
ICYCS |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Christopher L. Hayes, Yan Luo |
DPICO: a high speed deep packet inspection engine using compact finite automata. |
ANCS |
2007 |
DBLP DOI BibTeX RDF |
FPGA, intrusion detection, finite automata, content addressable memory |
41 | Boguslaw Schreyer, Wojciech Wawrzynski |
Finite automata models for CS problem with binary semaphore. |
ITiCSE |
2006 |
DBLP DOI BibTeX RDF |
computer science education, finite automata, process synchronization |
41 | Carlo Mereghetti, Beatrice Palano |
Upper Bounds on the Size of One-Way Quantum Finite Automata. |
ICTCS |
2001 |
DBLP DOI BibTeX RDF |
quantum finite automata, periodic events and languages |
41 | Christoph C. Michael, Anup K. Ghosh |
Using Finite Automata to Mine Execution Data for Intrusion Detection: A Preliminary Report. |
Recent Advances in Intrusion Detection |
2000 |
DBLP DOI BibTeX RDF |
data mining, machine learning, finite automata, feature detection |
40 | Henning Bordihn, Markus Holzer 0001, Martin Kutrib |
Hybrid Extended Finite Automata. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Till Tantau |
Comparing Verboseness for Finite Automata and Turing Machines. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Till Tantau |
Comparing Verboseness for Finite Automata and Turing Machines. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Mark R. Headington |
Introducing finite automata in the first course. |
SIGCSE |
1988 |
DBLP DOI BibTeX RDF |
|
40 | Giusi Castiglione, Antonio Restivo, Marinella Sciortino |
Hopcroft's Algorithm and Cyclic Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys |
Power of Cooperation and Multihead Finite Systems. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Brett D. Estrade, A. Louise Perkins, John M. Harris |
Explicitly Parallel Regular Expressions. |
IMSCCS (1) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Jürgen Dassow, György Vaszil |
P Finite Automata and Regular Languages over Countably Infinite Alphabets. |
Workshop on Membrane Computing |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Jean-Eric Pin (eds.) |
Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings |
Formal Properties of Finite Automata and Applications |
1989 |
DBLP DOI BibTeX RDF |
|
39 | Antonio Restivo |
Codes and Automata. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Maxime Crochemore |
Algorithms and automata. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Marcel Paul Schützenberger |
Décomposition polynomiale des fonctions rationnelles (English summary). |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Imre Simon |
Properties of factorization forests. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Pascal Weil |
Concatenation product: a survey. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Irène Guessarian |
A characterization of fair computations of finite state SCCS processes. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Howard Straubing |
The wreath product and its applications. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | John C. Meakin |
Automata and the word problem. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Aldo de Luca, Stefano Varricchio |
A finiteness condition for semigroups. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Jorge Almeida 0001 |
Equations for pseudovarieties. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Jean-Eric Pin |
Relational morphisms, transductions and operations on languages. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Didier Vergamini |
Verification of distributed systems: an experiment. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | G. Rauzy |
Numbers and automata. |
Formal Properties of Finite Automata and Applications |
1988 |
DBLP DOI BibTeX RDF |
|
39 | Emmanuel Jeandel |
Topological Automata. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
ProbabilisticAutomata, Formal Languages, Finite Automata, Quantum Automata |
39 | Richard Mayr |
On the Complexity of Bisimulation Problems for Pushdown Automata. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
verification, complexity, bisimulation, Pushdown automata |
38 | Thomas L. Casavant, Jon G. Kuhl |
Effects of Response and Stability on Scheduling in Distributed Computing Systems. |
IEEE Trans. Software Eng. |
1988 |
DBLP DOI BibTeX RDF |
user-defined objective, communicating finite automata models, first-order metric, scheduling, scheduling, load balancing, stability, distributed processing, dynamic systems, finite automata, response, distributed computing systems |
38 | Korakot Prachumrak |
Weighted Finite Automata encoding over Thai language. |
ICIS |
2009 |
DBLP DOI BibTeX RDF |
Thai language, weighted finite automata, data compression, text |
38 | Attila Csenki |
Flowgraph Models in Reliability and Finite Automata. |
IEEE Trans. Reliab. |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Jiming Ma, Haibin Zhu, Wenqian Shang |
The Construction Approach of Regular Expressions from Finite Automata Including Multi-Node Loops. |
IEEE ICCI |
2006 |
DBLP DOI BibTeX RDF |
|
38 | German Tischler |
Parametric Weighted Finite Automata for Figure Drawing. |
CIAA |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Till Tantau |
Towards a Cardinality Theorem for Finite Automata. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Pei-Chi Wu, Feng-Jian Wang, Kai-Ru Young |
Scanning regular languages by dual finite automata. |
ACM SIGPLAN Notices |
1992 |
DBLP DOI BibTeX RDF |
|
38 | Manuel Baclet, Claire Pagetti |
Around Hopcroft's Algorithm. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
Hopcroft’s algorithm, Finite automata, minimization |
38 | Lucian Ilie, Roberto Solis-Oba, Sheng Yu 0001 |
Reducing the Size of NFAs by Using Equivalences and Preorders. |
CPM |
2005 |
DBLP DOI BibTeX RDF |
state complexity, finite automata, equivalences, regular expression matching, preorders |
38 | Alberto Bertoni, Carlo Mereghetti, Beatrice Palano |
Quantum Computing: 1-Way Quantum Automata. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
quantum finite automata, formal power series |
38 | Lucian Ilie, Sheng Yu 0001 |
Algorithms for Computing Small NFAs. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
follow relations, invariant equivalences, algorithms, regular expressions, positions, partial derivatives, quotients, nondeterministic finite automata |
37 | Ren-ji Tao |
Invertibility of Linear Finite Automata Over a Ring. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
36 | 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 |
36 | Michela Becchi, Patrick Crowley |
Extending finite automata to efficiently match Perl-compatible regular expressions. |
CoNEXT |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Klaus Reinhardt |
The Complexity of Translating Logic to Finite Automata. |
Automata, Logics, and Infinite Games |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev |
Quantum versus Probabilistic One-Way Finite Automata with Counter. |
SOFSEM |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Manfred Droste, Karin Quaas |
A Kleene-Schützenberger Theorem for Weighted Timed Automata. |
FoSSaCS |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Li Sheng, Yongming Li 0001 |
Regular grammars with truth values in lattice-ordered monoid and their languages. |
Soft Comput. |
2006 |
DBLP DOI BibTeX RDF |
Fuzzy finite automata, Fuzzy regular grammar, Fuzzy regular language, Lattice-ordered monoid |
36 | Pavol Duris, Juraj Hromkovic, Katsushi Inoue |
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. |
CCC |
2000 |
DBLP DOI BibTeX RDF |
Las Vegas randomization, two-dimensional finite automata, nondeterminism |
36 | Takeshi Koshiba |
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Marats Golovkins, Maksim Kravtsev |
Probabilistic Reversible Automata and Quantum Automata. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Bernard Boigelot, Stéphane Rassart, Pierre Wolper |
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
34 | Manfred Droste, Guo-Qiang Zhang 0001 |
Rational Transformations of Formal Power Series. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
rational languages, recognizable languages, weighted finite automata, Formal power series |
34 | Anup Kumar Keshri, Rakesh Kumar Sinha, Rajesh Hatwal, Barda Nand Das |
Epileptic Spike Recognition in Electroencephalogram Using Deterministic Finite Automata. |
J. Medical Syst. |
2009 |
DBLP DOI BibTeX RDF |
Epileptic spike, Electroencephalogram, Automated system, Deterministic finite automata |
34 | Piti Piyachon, Yan Luo |
Design of high performance pattern matching engine through compact deterministic finite automata. |
DAC |
2008 |
DBLP DOI BibTeX RDF |
pattern matching, content addressable memory, deterministic finite automata |
34 | Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel |
An Inference Implementation Based on Extended Weighted Finite Automata. |
ACSC |
2001 |
DBLP DOI BibTeX RDF |
Weighted finite automata, image compression, self-similarity, inference algorithm |
34 | Klaus Brouwer, Wolfgang Gellerich, Erhard Plödereder |
Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis. |
CC |
1998 |
DBLP DOI BibTeX RDF |
Finite Automata, Lexical Analysis, Scanner, Run-time Efficiency |
34 | Ullrich Hafner |
Image and Video Coding with Weighted Finite Automata. |
ICIP (1) |
1997 |
DBLP DOI BibTeX RDF |
rate distortion constrained approximation, weighted finite automata, picture sequences, temporal redundancies removal, spatial redundancies removal, mathematical structure, efficient hybrid compression methods, coding algorithm, coarse linear combination, inter-frame coding, intra-frame coding, H.263 video coding standard, adaptive image partitioning, prediction, image coding, image coding, motion compensation, self similarities, entropy coding |
34 | 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 |
|
34 | Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger |
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
Las Vegas, communication complexity, automata, determinism, computational and structural complexity |
33 | Kyubum Wee, Byungeun Moon |
Automatic Generation of Finite State Automata for Detecting Intrusions Using System Call Sequences. |
MMM-ACNS |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Clifford A. Reiter |
Infix, Cut and Finite Automata. |
APL |
1995 |
DBLP DOI BibTeX RDF |
APL, J |
33 | Zamir Bavel |
Structure and Transition-Preserving Functions of Finite Automata. |
J. ACM |
1968 |
DBLP DOI BibTeX RDF |
|
33 | Feng Bao 0004, Yoshihide Igarashi |
A Randomized Algorithm to Finite Automata Public Key Cryptosystem. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Hing Leung |
On Finite Automata with Limited Nondeterminism. |
Acta Informatica |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2071 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|