Search results for "DFA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
165	Jens Knoop	From DFA-Frameworks to DFA-Generators: A Unifying Multiparadigm Approach.	TACAS	1999	DBLP DOI BibTeX RDF	data-flow analysis (DFA), DFA-frameworks, DFA-generators, coincidence theorems, intraprocedural, conditional DFA, parallel, object-oriented, abstract interpretation, Program optimization, interprocedural
152	Bala Ravikumar	Weak Minimization of DFA - An Algorithm and Applications.	CIAA	2003	DBLP DOI BibTeX RDF
99	Avraham Trakhtman	Some Aspects of Synchronization of DFA.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	deterministic finite automata (DFA), aperiodic semigroup, ?erný conjecture, synchronization
97	Matthias F. Stallmann, Suzanne Balik, Robert D. Rodman, Sina Bahram, Michael C. Grace, Susan D. High	ProofChecker: an accessible environment for automata theory correctness proofs.	ITiCSE	2007	DBLP DOI BibTeX RDF	accessibility, finite automata, correctness proof
85	Raphael C.-W. Phan, Sung-Ming Yen	Amplifying Side-Channel Attacks with Techniques from Block Cipher Cryptanalysis.	CARDIS	2006	DBLP DOI BibTeX RDF	Attacks and countermeasures in hardware and software, cryptanalysis, Advanced Encryption Standard, side-channel attacks, fault attacks
81	Sailesh Kumar, Sarang Dharmapurikar, Fang Yu 0002, Patrick Crowley, Jonathan S. Turner	Algorithms to accelerate multiple regular expressions matching for deep packet inspection.	SIGCOMM	2006	DBLP DOI BibTeX RDF	regular expressions, DFA, deep packet inspection
81	Sailesh Kumar, Jonathan S. Turner, John Williams	Advanced algorithms for fast and scalable deep packet inspection.	ANCS	2006	DBLP DOI BibTeX RDF	regular expressions, DFA, deep packet inspection
80	Leonard Pitt, Manfred K. Warmuth	The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial.	J. ACM	1993	DBLP DOI BibTeX RDF	minimization of finite state machines, approximation algorithms, nonapproximability
76	Feodor Kulishov	DFA-based and SIMD NFA-based regular expression matching on cell BE for fast network traffic filtering.	SIN	2009	DBLP DOI BibTeX RDF	network security, SIMD, regular expressions, cell broadband engine, DFA, NFA
76	François Coste, Jacques Nicolas	How Considering Incompatible State Mergings May Reduce the DFA Induction Search Tree.	ICGI	1998	DBLP DOI BibTeX RDF	grammatical inference, search tree, DFA, constraint system
73	Anirban Majumder, Rajeev Rastogi, Sriram Vanama	Scalable regular expression matching on data streams.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	data streams, deep packet inspection, regular expression matching
73	Makoto Onizuka	Light-weight xPath processing of XML stream with deterministic automata.	CIKM	2003	DBLP DOI BibTeX RDF	XPath processing, streaming XML, automata, selective dissemination of information
67	Lei Pan 0007, Hongyi Wu, Xiaojun Cao	Design and analysis of a distributed and fair access (DFA) MAC protocol for multihop wireless networks.	IEEE Trans. Wirel. Commun.	2009	DBLP DOI BibTeX RDF
67	Yu-Fang Chen 0001, Azadeh Farzan, Edmund M. Clarke, Yih-Kuen Tsay, Bow-Yaw Wang	Learning Minimal Separating DFA's for Compositional Verification.	TACAS	2009	DBLP DOI BibTeX RDF
64	Toru Yazawa, Tomoo Katsuyama	Premature ventricular contractions, a typical extra-systole arrhythmia, lowers the scaling exponent: DFA as a beneficial biomedical computation.	ICIS	2009	DBLP DOI BibTeX RDF	PVC, extra-systol, scaling exponent, time series analysis, DFA, heartbeat
63	Leonor Becerra-Bonache, Adrian-Horia Dediu, Cristina Tîrnauca	Learning DFA from Correction and Equivalence Queries.	ICGI	2006	DBLP DOI BibTeX RDF	learning DFA, Active learning, membership query, equivalence query, correction query
61	Christian Bühler	Design for All - from Idea to Practise.	ICCHP	2008	DBLP DOI BibTeX RDF	Design-for-all-process, European 3-strategies approach, variety of user requirements, continuum of solutions, Universal Design, Inclusive Design, Design for all
61	Yinfei Pan, Ying Zhang, Kenneth Chiu, Wei Lu	Parallel XML Parsing Using Meta-DFAs.	eScience	2007	DBLP DOI BibTeX RDF
61	Iosif Klironomos, Margherita Antona, Ioannis Basdekis, Constantine Stephanidis	White Paper: promoting Design for All and e-Accessibility in Europe.	Univers. Access Inf. Soc.	2006	DBLP DOI BibTeX RDF
61	Tao Jiang 0001, Edward McDowell, Bala Ravikumar	The Structure and Complexity of Minimal NFA's over a Unary Alphabet.	FSTTCS	1991	DBLP DOI BibTeX RDF
57	Sailesh Kumar, Balakrishnan Chandrasekaran 0002, Jonathan S. Turner, George Varghese	Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia.	ANCS	2007	DBLP DOI BibTeX RDF	regular expressions, DFA, deep packet inspection
57	Michela Becchi, Patrick Crowley	An improved algorithm to accelerate regular expression evaluation.	ANCS	2007	DBLP DOI BibTeX RDF	regular expressions, DFA, deep packet inspection
57	Fang Yu 0002, Zhifeng Chen, Yanlei Diao, T. V. Lakshman, Randy H. Katz	Fast and memory-efficient regular expression matching for deep packet inspection.	ANCS	2006	DBLP DOI BibTeX RDF	deep packet, intrusion detection, inspection, regular expressions, DFA
55	A. N. Trahtman	Synchronization of Some DFA.	TAMC	2007	DBLP DOI BibTeX RDF	aperiodic semigroup, ?erny conjecture, synchronization, Deterministic finite automata
55	Gonzalo Navarro 0001, Mathieu Raffinot	Compact DFA Representation for Fast Regular Expression Search.	WAE	2001	DBLP DOI BibTeX RDF
55	José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe 0001	An Optimal Parallel Algorithm for Learning DFA.	COLT	1994	DBLP DOI BibTeX RDF
55	Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell	Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.	ICALP	1984	DBLP DOI BibTeX RDF
52	Jinjing Huang, Lei Zhao 0001, Jiwen Yang	SRDFA: A Kind of Session Reconstruction DFA.	NPC	2008	DBLP DOI BibTeX RDF	session reconstruction, web usage mining, DFA
49	Gonzalo Navarro 0001	Implementation and Application of Automata in String Processing.	CIAA	2009	DBLP DOI BibTeX RDF
49	Matthieu Rivain	Differential Fault Analysis on DES Middle Rounds.	CHES	2009	DBLP DOI BibTeX RDF
49	Gianfranco Lamperti, Marina Zanella, Giovanni Chiodi, Lorenzo Chiodi	Incremental Determinization of Finite Automata in Model-Based Diagnosis of Active Systems.	KES (1)	2008	DBLP DOI BibTeX RDF
49	Xi Chen 0014, Siu Chung Wong, Chi Kong Tse, Ljiljana Trajkovic	Stability study of the TCP-RED system using detrended fluctuation analysis.	ISCAS	2008	DBLP DOI BibTeX RDF
49	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
49	Hongbin Lu, Kai Zheng 0003, Bin Liu 0001, Xin Zhang 0003, Y. Liu	A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection.	IEEE J. Sel. Areas Commun.	2006	DBLP DOI BibTeX RDF
49	Zachary K. Baker, Viktor K. Prasanna, Hong-Jip Jung	Regular Expression Software Deceleration for Intrusion Detection Systems.	FPL	2006	DBLP DOI BibTeX RDF
49	A. N. Trahtman	An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny Conjecture.	MFCS	2006	DBLP DOI BibTeX RDF
49	Simon M. Lucas, T. Jeff Reynolds	Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm.	IEEE Trans. Pattern Anal. Mach. Intell.	2005	DBLP DOI BibTeX RDF
49	Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan Suciu	Processing XML Streams with Deterministic Automata.	ICDT	2003	DBLP DOI BibTeX RDF
49	Cezar Câmpeanu, Andrei Paun	The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata.	CIAA	2002	DBLP DOI BibTeX RDF
49	Jens Knoop	Parallel Data-Flow Analysis of Explicitly Parallel Programs.	Euro-Par	1999	DBLP DOI BibTeX RDF
49	Rodrigue Byrne	Determining Aliasing Probabilities in BIST by Counting Strings.	J. Electron. Test.	1997	DBLP DOI BibTeX RDF	response analysis architectures, compression techniques, aliasing probabilities, deterministic finite automata
49	Christian W. Omlin, C. Lee Giles	Constructing Deterministic Finite-State Automata in Recurrent Neural Networks.	J. ACM	1996	DBLP DOI BibTeX RDF	knowledge encoding, neural networks, stability, rules, automata, recurrent neural networks, nonlinear dynamics, connectionism
49	Tsern-Huei Lee, Jin-Jye Chou	Testing the Dynamic Full Access Property of a Class of Multistage Interconnection Networks.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	dynamic full access property, multistage interconnectionnetworks, faulty banyan networ, multiprocessor system reconfiguration, test procedure, faulty switching elements, fault tolerant computing, probability, multiprocessor interconnection networks, reconfigurable architectures, computer testing, network decomposition
45	Chong Hee Kim, Jean-Jacques Quisquater	New Differential Fault Analysis on AES Key Schedule: Two Faults Are Enough.	CARDIS	2008	DBLP DOI BibTeX RDF	AES key schedule, AES, Fault attack, DFA, Differential Fault Analysis
45	Toru Yazawa, Katsunori Tanaka, Tomoo Katsuyama	Detrended Fluctuation Analysis of Heartbeat Interval Signal: Alternans Lowers the Scaling Exponent of Heartbeat Fluctuation Dynamics in Animal Models and Humans.	BMEI (2)	2008	DBLP DOI BibTeX RDF	Alternans, Animal Models, Scaling, DFA, Heartbeat, Fluctuation
45	Michela Becchi, Patrick Crowley	A hybrid finite automaton for practical deep packet inspection.	CoNEXT	2007	DBLP DOI BibTeX RDF	regular expressions, DFA, deep packet inspection, NFA
44	Agathe Merceron	Design patterns to support teaching of automata theory.	ITiCSE	2009	DBLP DOI BibTeX RDF	deterministic finite automaton (dfa), design pattern
44	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
44	Chien-Ning Chen, Sung-Ming Yen	Differential Fault Analysis on AES Key Schedule and Some Coutnermeasures.	ACISP	2003	DBLP DOI BibTeX RDF	Differential fault analysis (DFA), Smart cards, AES, Rijndael, Physical cryptanalysis
43	Bernard Lambeau, Christophe Damas, Pierre Dupont	State-Merging DFA Induction Algorithms with Mandatory Merge Constraints.	ICGI	2008	DBLP DOI BibTeX RDF
43	Junko Takahashi, Toshinori Fukunaga, Kimihiro Yamakoshi	DFA Mechanism on the AES Key Schedule.	FDTC	2007	DBLP DOI BibTeX RDF
43	John Abela, François Coste, Sandro Spina	Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA.	ICGI	2004	DBLP DOI BibTeX RDF
43	Ambuj Tewari, Utkarsh Srivastava, P. Gupta	A Parallel DFA Minimization Algorithm.	HiPC	2002	DBLP DOI BibTeX RDF
43	Rajesh Parekh, Codrin M. Nichitiu, Vasant G. Honavar	A Polynominal Time Incremental Algorithm for Learning DFA.	ICGI	1998	DBLP DOI BibTeX RDF
40	Kunyang Peng, Siyuan Tang, Min Chen, Qunfeng Dong	Chain-Based DFA Deflation for Fast and Scalable Regular Expression Matching Using TCAM.	ANCS	2011	DBLP DOI BibTeX RDF	DFA, Deep Packet Inspection, TCAM, Regular Expression Matching
38	Michela Becchi, Patrick Crowley	A-DFA: A Time- and Space-Efficient DFA Compression Algorithm for Fast Regular Expression Evaluation.	ACM Trans. Archit. Code Optim.	2013	DBLP DOI BibTeX RDF
38	Yi Tang 0002, Junchen Jiang, Chengchen Hu, Bin Liu 0001	Managing DFA History with Queue for Deflation DFA.	J. Netw. Syst. Manag.	2012	DBLP DOI BibTeX RDF
38	Cheng-Hung Lin, Jyh-Charn Liu	M-DFA (multithreaded DFA): an algorithm for reduction of state transitions and acceleration of REGEXP matching.	ANCS	2012	DBLP DOI BibTeX RDF
38	Yi Tang 0002, Junchen Jiang, Xiaofei Wang 0006, Chengchen Hu, Bin Liu 0001, Zhijia Chen	Parallel DFA Architecture for Ultra High Throughput DFA-Based Pattern Matching.	IEICE Trans. Inf. Syst.	2010	DBLP DOI BibTeX RDF
38	Gao Xia, Xiaofei Wang 0006, Bin Liu 0001	SRD-DFA: Achieving Sub-rule Distinguishing with Extended DFA Structure.	DASC	2009	DBLP DOI BibTeX RDF
36	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
36	Jan Holub 0001, Stanislav Stekr	On Parallel Implementations of Deterministic Finite Automata.	CIAA	2009	DBLP DOI BibTeX RDF
36	Tian Song, Wei Zhang, Dongsheng Wang 0002, Yibo Xue	A Memory Efficient Multiple Pattern Matching Architecture for Network Security.	INFOCOM	2008	DBLP DOI BibTeX RDF
36	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
36	Viliam Geffert	Magic Numbers in the State Hierarchy of Finite Automata.	MFCS	2006	DBLP DOI BibTeX RDF
36	Martin Eling, Thomas Parnitzke, Hato Schmeiser	A Management Rule of Thumb in Property-Liability Insurance.	OR	2006	DBLP DOI BibTeX RDF
36	Therese Berg, Bengt Jonsson 0001, Harald Raffelt	Regular Inference for State Machines with Parameters.	FASE	2006	DBLP DOI BibTeX RDF
36	François Jacquenet, Marc Sebban, Georges Valétudie	Mining Decision Rules from Deterministic Finite Automata.	ICTAI	2004	DBLP DOI BibTeX RDF
36	Pierre Dusart, Gilles Letourneux, Olivier Vivolo	Differential Fault Analysis on A.E.S.	ACNS	2003	DBLP DOI BibTeX RDF
36	Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara	Ternary Directed Acyclic Word Graphs.	CIAA	2003	DBLP DOI BibTeX RDF
36	François Coste, Daniel Fredouille	Unambiguous Automata Inference by Means of State-Merging Methods.	ECML	2003	DBLP DOI BibTeX RDF
36	Markus Holzer 0001, Martin Kutrib	State Complexity of Basic Operations on Nondeterministic Finite Automata.	CIAA	2002	DBLP DOI BibTeX RDF
36	Gerard J. Holzmann, Anuj Puri	A Minimized Automaton Representation of Reachable States.	Int. J. Softw. Tools Technol. Transf.	1999	DBLP DOI BibTeX RDF	Model checking, Verification, Data compression, Finite automata, Spin, OBDDs, Sharing trees
36	Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu 0001	State Complexity of Basic Operations on Finite Languages.	WIA	1999	DBLP DOI BibTeX RDF
36	Pascal Paillier	Evaluating Differential Fault Analysis of Unknown Cryptosystems.	Public Key Cryptography	1999	DBLP DOI BibTeX RDF
36	Rafael C. Carrasco, Mikel L. Forcada	Second-Order Recurrent Neural Networks Can Learn Regular Grammars from Noisy Strings.	IWANN	1995	DBLP DOI BibTeX RDF
36	Joo Y. Jung, Samir B. Billatos	An expert system for assembly based on Axiomatic Design principles.	J. Intell. Robotic Syst.	1993	DBLP DOI BibTeX RDF	Axiomatic design, design for assembly, expert systems, knowledge base
36	Tao Jiang 0001, Bala Ravikumar	Minimal NFA Problems Are Hard.	ICALP	1991	DBLP DOI BibTeX RDF
36	Suresh Chalasani, Anujan Varma, Cauligi S. Raghavendra	Fault-tolerant routing in MIN-based supercomputers.	SC	1990	DBLP DOI BibTeX RDF
33	Xiaohong Li 0001, Danjie Yang, Zhiyong Feng 0002	Design and Implementation of Negotiation Agent of Dynamic Supply Chain.	ICITA (1)	2005	DBLP DOI BibTeX RDF	dynamic supply chain management, intelligent agent, negotiation, DFA
33	Régis Bevan	Improved Zero Value Attack on XTR.	ACISP	2005	DBLP DOI BibTeX RDF	MRPA, smart cards, Power Analysis, DFA, XTR
32	Claes Tjäder	Design for All Approach with the Aim to Support Autonomous Living for Elderly People in Ordinary Residences - An Implementation Strategy.	HCI (6)	2009	DBLP DOI BibTeX RDF	autonomous living, DfA technology support, real estate and/or housing enterprises, Elderly, implementation strategy
32	Michael D. Adams 0001, R. Kent Dybvig	Efficient nondestructive equality checking for trees and graphs.	ICFP	2008	DBLP DOI BibTeX RDF	dfa equivalence, eq hash tables, scheme, equality, union-find
32	Pieter W. Adriaans	Learning as Data Compression.	CiE	2007	DBLP DOI BibTeX RDF	learning as compression, two-part code optimization, randomness deficiency, DFA induction, MDL
31	Marcel Tichem, Dafina Tanase	A DFA Framework for Hybrid Microsystems.	IPAS	2008	DBLP DOI BibTeX RDF
31	Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Petrini	Peak-Performance DFA-based String Matching on the Cell Processor.	IPDPS	2007	DBLP DOI BibTeX RDF
31	Carlos Roberto Moratelli, Érika F. Cota, Marcelo Lubaszewski	A cryptography core tolerant to DFA fault attacks.	SBCCI	2006	DBLP DOI BibTeX RDF	cryptography, smart cards, fault attacks
31	Christophe Giraud 0001	DFA on AES.	AES Conference	2004	DBLP DOI BibTeX RDF
31	Jie Dai, Kexiao Liao, Gongzhu Hu	Network Layer XML Routing Using Lazy DFA.	SERA	2004	DBLP DOI BibTeX RDF
31	Kevin J. Lang, Barak A. Pearlmutter, Rodney A. Price	Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm.	ICGI	1998	DBLP DOI BibTeX RDF
31	Kevin J. Lang	Random DFA's Can Be Approximately Learned from Sparse Uniform Examples.	COLT	1992	DBLP DOI BibTeX RDF
24	Markus Holzer 0001, Andreas Maletti	An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.	CIAA	2009	DBLP DOI BibTeX RDF
24	Alexandre Berzati, Cécile Canovas-Dumas, Louis Goubin	Fault Analysis of Rabbit: Toward a Secret Key Leakage.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	carry analysis, Stream cipher, fault attacks, Rabbit
24	Michael R. Head, Madhusudhan Govindaraju	Performance enhancement with speculative execution based parallelism for processing large-scale xml-based application data.	HPDC	2009	DBLP DOI BibTeX RDF	chip-level multiprocessing, parallel techniques, xml datasets
24	Jean-Marc Bardet, Imen Kammoun	Asymptotic Properties of the Detrended Fluctuation Analysis of Long-Range-Dependent Processes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
24	Pawan Goyal 0002, Vipul Arora 0001, Laxmidhar Behera	Analysis of Sanskrit Text: Parsing and Semantic Relations.	Sanskrit Computational Linguistics	2008	DBLP DOI BibTeX RDF
24	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
24	Bennett Setzer	Minimal finite automata from finite training sets.	ACM Southeast Regional Conference	2008	DBLP DOI BibTeX RDF	inducing regular sets, regular sets, finite automata
24	Kun Huang 0003, Dafang Zhang	A Byte-Filtered String Matching Algorithm for Fast Deep Packet Inspection.	ICYCS	2008	DBLP DOI BibTeX RDF
24	Andrew Badr	Hyper-Minimization in O(n2).	CIAA	2008	DBLP DOI BibTeX RDF