Search results for "NFA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
140	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
134	Bala Ravikumar, Nicolae Santean	Deterministic Simulation of a NFA with k -Symbol Lookahead.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
120	Lucian Ilie, Sheng Yu 0001	Constructing NFA s by Optimal Use of Positions in Regular Expressions.	CPM	2002	DBLP DOI BibTeX RDF	right-invariant equivalence, $varepsilon$-elimination, algorithms, regular expressions, positions, partial derivatives, quotients, regular expression matching, nondeterministic finite automata
105	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
92	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
84	Makoto Onizuka	Processing XPath queries with forward and downward axes over XML streams.	EDBT	2010	DBLP DOI BibTeX RDF	XPath, automata, XML stream
84	Toshihiro Katashita, Atusi Maeda, Kenji Toda, Yoshinori Yamaguchi	A Method of Generating Highly Efficient String Matching Circuit for Intrusion Detection.	FPL	2006	DBLP DOI BibTeX RDF
84	Sebastian John	Minimal Unambiguous eNFA.	CIAA	2004	DBLP DOI BibTeX RDF
82	Yi-Hua E. Yang, Weirong Jiang, Viktor K. Prasanna	Compact architecture for high-throughput regular expression matching on FPGA.	ANCS	2008	DBLP DOI BibTeX RDF	BRAM, FPGA, intrusion detection, finite state machine, regular expression, NFA
78	Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kamiya	High-speed regular expression matching engine using multi-character NFA.	FPL	2008	DBLP DOI BibTeX RDF
78	Juraj Hromkovic, Georg Schnitger	On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
78	Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov	On a Maximal NFA Without Mergible States.	CSR	2006	DBLP DOI BibTeX RDF
70	Markus Holzer 0001, Martin Kutrib	State Complexity of Basic Operations on Nondeterministic Finite Automata.	CIAA	2002	DBLP DOI BibTeX RDF
67	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
64	Heikki Hyyrö	Tighter Packed Bit-Parallel NFA for Approximate String Matching.	CIAA	2006	DBLP DOI BibTeX RDF
64	Guangming Xing	A simple way to construct NFA with fewer states and transitions.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF
63	Hao Wang, Shi Pu, Gabriel Knezek, Jyh-Charn Liu	A modular NFA architecture for regular expression matching.	FPGA	2010	DBLP DOI BibTeX RDF	character class constraint repetition, overlapped matching, FPGA, regular expression, NFA
56	Zhifeng Li 0001, Dahua Lin, Xiaoou Tang	Nonparametric Discriminant Analysis for Face Recognition.	IEEE Trans. Pattern Anal. Mach. Intell.	2009	DBLP DOI BibTeX RDF
56	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
56	François Denis, Aurélien Lemay, Alain Terlutte	Residual Finite State Automata.	STACS	2001	DBLP DOI BibTeX RDF
50	Zhiyong Liu, Lei Xu 0001	On Convergence of an Iterative Factor Estimate Algorithm for the NFA Model.	ICANN	2002	DBLP DOI BibTeX RDF
50	Jan Holub 0001	Bit Parallelism - NFA Simulation.	CIAA	2001	DBLP DOI BibTeX RDF
50	Christian Hagenah, Anca Muscholl	Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.	MFCS	1998	DBLP DOI BibTeX RDF
50	Tao Jiang 0001, Bala Ravikumar	Minimal NFA Problems Are Hard.	ICALP	1991	DBLP DOI BibTeX RDF
44	Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy	Inference of Over-Constrained NFA of Size k+1 to Efficiently and Systematically Derive NFA of Size k for Grammar Learning.	ICCS (1)	2023	DBLP DOI BibTeX RDF
44	Matteo Avalle, Fulvio Risso, Riccardo Sisto	Scalable Algorithms for NFA Multi-Striding and NFA-Based Deep Packet Inspection on GPUs.	IEEE/ACM Trans. Netw.	2016	DBLP DOI BibTeX RDF
44	Arihant Jain	Equivalence of SDVFA of order (s, t) with DFA, VDFA, NFA and e-NFA.	Ars Comb.	2014	DBLP BibTeX RDF
44	Hing Leung	Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA.	ISAAC	1993	DBLP DOI BibTeX RDF
42	Margareta Ackerman, Erkki Mäkinen	Three New Algorithms for Regular Language Enumeration.	COCOON	2009	DBLP DOI BibTeX RDF
42	Xuhui Liu, Guoliang Li 0001, Jianhua Feng, Lizhu Zhou	Effective Indices for Efficient Approximate String Search and Similarity Join.	WAIM	2008	DBLP DOI BibTeX RDF
42	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
42	Geoffrey Smith 0001	Inductive bases and their application to searches for minimal unary NFAs.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF
42	Michael Domaratzki, Kai Salomaa	Lower Bounds for the Transition Complexity of NFAs.	MFCS	2006	DBLP DOI BibTeX RDF
42	Viliam Geffert	Magic Numbers in the State Hierarchy of Finite Automata.	MFCS	2006	DBLP DOI BibTeX RDF
42	Toshihiro Katashita, Atusi Maeda, Kenji Toda, Yoshinori Yamaguchi	Highly Efficient String Matching Circuit for IDS with FPGA.	FCCM	2006	DBLP DOI BibTeX RDF
42	Giovanna Melideo, Stefano Varricchio	Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.	ALT	1998	DBLP DOI BibTeX RDF
41	Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag Johansen	Distributed event stream processing with non-deterministic finite automata.	DEBS	2009	DBLP DOI BibTeX RDF	continuous queries, publish-subscribe, event streams, NFA
36	Gregor Gramlich, Georg Schnitger	Minimizing NFA's and Regular Expressions.	STACS	2005	DBLP DOI BibTeX RDF
36	Bo Luo, Dongwon Lee 0001, Wang-Chien Lee, Peng Liu 0005	QFilter: fine-grained run-time XML access control via NFA-based query rewriting.	CIKM	2004	DBLP DOI BibTeX RDF	data security and privacy, query rewriting, XML security
36	Libor Polák	Minimalizations of NFA Using the Universal Automaton.	CIAA	2004	DBLP DOI BibTeX RDF
36	Jean-Marc Champarnaud, Fabien Coulon	NFA Reduction Algorithms by Means of Regular Inequalities.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
36	Forrest Brewer, Steve Haynal	Symbolic NFA scheduling of a RISC microprocessor.	IEEE Trans. Very Large Scale Integr. Syst.	2002	DBLP DOI BibTeX RDF
36	Zhiyong Liu, Lei Xu 0001	A Comparative Study on Three MAP Factor Estimate Approaches for NFA.	IDEAL	2002	DBLP DOI BibTeX RDF
28	Davide Bresolin, Angelo Montanari, Gabriele Puppis	A theory of ultimately periodic languages and automata with an application to time granularity.	Acta Informatica	2009	DBLP DOI BibTeX RDF
28	Yuan Mei, Samuel Madden 0001	ZStream: a cost-based query processor for adaptively detecting composite events.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	optimization, algorithm, streaming, complex event processing
28	Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey O. Shallit	Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
28	Galina Jirásková	On the State Complexity of Complements, Stars, and Reversals of Regular Languages.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
28	Miad Faezipour, Mehrdad Nourani	Constraint Repetition Inspection for Regular Expression on FPGA.	Hot Interconnects	2008	DBLP DOI BibTeX RDF	Non-deterministic Finite Automata, Constraint Repetition Inspection, Regular Expression, Network Intrusion Detection System
28	Yu Zhang 0086, Yihua Cao, Xunhao Li	A Decision Procedure for XPath Satisfiability in the Presence of DTD Containing Choice.	APWeb	2008	DBLP DOI BibTeX RDF	DTD choice, XPath satisfiability, automaton
28	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
28	G. Tholkappia Arasu, V. Palanisamy	NeuroFuzzy Agent Programming for Processing of EEG/ECG/EMG Waveforms.	ITNG	2007	DBLP DOI BibTeX RDF
28	Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan	Compiling PCRE to FPGA for accelerating SNORT IDS.	ANCS	2007	DBLP DOI BibTeX RDF	deep payload inspection, nondeterministic nite automata, intrusion detection system, regular expressions
28	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
28	Yinglian Xie, Vyas Sekar, Michael K. Reiter, Hui Zhang 0001	Forensic Analysis for Epidemic Attacks in Federated Networks.	ICNP	2006	DBLP DOI BibTeX RDF
28	Alan J. Demers, Johannes Gehrke, Mingsheng Hong, Mirek Riedewald, Walker M. White	Towards Expressive Publish/Subscribe Systems.	EDBT	2006	DBLP DOI BibTeX RDF
28	Deian Tabakov, Moshe Y. Vardi	Experimental Evaluation of Classical Automata Constructions.	LPAR	2005	DBLP DOI BibTeX RDF
28	Juraj Hromkovic, Georg Schnitger	NFAs With and Without epsilon-Transitions.	ICALP	2005	DBLP DOI BibTeX RDF
28	Hiroaki Yamamoto	A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.	ISAAC	2003	DBLP DOI BibTeX RDF
28	Lynette van Zijl	Succinct Descriptions of Regular Languages with Binary +-NFAs.	CIAA	2003	DBLP DOI BibTeX RDF
28	Jan Holub 0001, Borivoj Melichar	Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.	Workshop on Implementing Automata	1998	DBLP DOI BibTeX RDF
28	Juraj Hromkovic, Sebastian Seibert, Thomas Wilke	Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.	STACS	1997	DBLP DOI BibTeX RDF
28	Valentin M. Antimirov	Partial Derivates of Regular Expressions and Finite Automata Constructions.	STACS	1995	DBLP DOI BibTeX RDF
28	Craig A. Rich	The Complexity of a Counting Finite-State Automaton.	FSTTCS	1988	DBLP DOI BibTeX RDF
28	Oscar H. Ibarra, Bala Ravikumar	Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation.	FSTTCS	1987	DBLP DOI BibTeX RDF
28	Andreas Weber, Helmut Seidl	On the Degree of Ambiguity of Finite Automata.	MFCS	1986	DBLP DOI BibTeX RDF
27	Yoichi Wakaba, Masato Inagi, Shin'ichi Wakabayashi, Shinobu Nagayama	An Efficient Hardware Matching Engine for Regular Expression with Nested Kleene Operators.	FPL	2011	DBLP DOI BibTeX RDF	FPGA, regular expression, NIDS, NFA
27	Rafael Grompone von Gioi, Jérémie Jakubowicz, Jean-Michel Morel, Gregory Randall	LSD: A Fast Line Segment Detector with a False Detection Control.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	Line segment detection, Helmholtz principle, a contrario detection, NFA
27	Yi-Hua E. Yang, Viktor K. Prasanna	Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA.	ReConFig	2008	DBLP DOI BibTeX RDF	BRAM, FPGA, finite state machine, Regular expression, NFA
27	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
22	Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen	The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds.	ITCS	2024	DBLP DOI BibTeX RDF
22	Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis	Approximate NFA universality and related problems motivated by information theory.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
22	Kuldeep S. Meel, Sourav Chakraborty 0001, Umang Mathur 0001	A faster FPRAS for #NFA.	CoRR	2023	DBLP DOI BibTeX RDF
22	Alina Ciocarlan, Sylvie Le Hégarat-Mascle, Sidonie Lefebvre, Arnaud Woiselle	Deep-NFA: a Deep a contrario Framework for Small Object Detection.	CoRR	2023	DBLP DOI BibTeX RDF
22	Karl Bringmann, Allan Grønlund, Marvin Künnemann, Kasper Green Larsen	The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds.	CoRR	2023	DBLP DOI BibTeX RDF
22	Michal Hospodár, Jozef Jirásek 0001, Galina Jirásková, Juraj Sebej	Operational Complexity: NFA-to-DFA Trade-Off.	DCFS	2023	DBLP DOI BibTeX RDF
22	Qigui Yao, Xiaojian Zhang, Jiaxuan Fei, Wen Ji, Caiwei Guo	NFA Regular Expression Matching based Electriuec Power Sensitive Data Recognition Algorithm Design and Simulation.	CNML	2023	DBLP DOI BibTeX RDF
22	Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis	Approximate NFA Universality and Related Problems Motivated by Information Theory.	CoRR	2022	DBLP BibTeX RDF
22	Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis	Approximate NFA Universality Motivated by Information Theory.	DCFS	2022	DBLP DOI BibTeX RDF
22	Brian Riccardi, Riccardo Romanello, Alberto Policriti, Christian Bianchini	Incremental NFA Minimization.	ICTCS	2022	DBLP BibTeX RDF
22	Edith Hemaspaandra, David E. Narváez	Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification.	CICM	2022	DBLP DOI BibTeX RDF
22	Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros	#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes.	J. ACM	2021	DBLP DOI BibTeX RDF
22	Frédéric Lardeux, Éric Monfroy	GA and ILS for optimizing the size of NFA models.	CoRR	2021	DBLP BibTeX RDF
22	Frédéric Lardeux, Éric Monfroy	Improved SAT models for NFA learning.	CoRR	2021	DBLP BibTeX RDF
22	Kamil Sert, Cüneyt F. Bazlamaçci	NFA Based Regular Expression Matching on FPGA.	CITS	2021	DBLP DOI BibTeX RDF
22	Frédéric Lardeux, Éric Monfroy	Improved SAT Models for NFA Learning.	OLA	2021	DBLP DOI BibTeX RDF
22	Hannah Miller, David E. Narváez	Toward Determining NFA Equivalence via QBFs (Student Abstract).	AAAI	2021	DBLP DOI BibTeX RDF
22	Frédéric Lardeux, Éric Monfroy	Optimized models and symmetry breaking for the NFA inference problem.	ICTAI	2021	DBLP DOI BibTeX RDF
22	Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros	A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper).	STOC	2021	DBLP DOI BibTeX RDF
22	Galina Jirásková, Ivana Krajnáková	NFA-to-DFA Trade-Off for Regular Operations.	DCFS	2019	DBLP DOI BibTeX RDF
22	Tomasz Jastrzab	On Superlinear Speedups of a Parallel NFA Induction Algorithm.	PARCO	2019	DBLP DOI BibTeX RDF
22	Tomasz Jastrzab	A Comparison of Selected Variable Ordering Methods for NFA Induction.	ICCS (5)	2019	DBLP DOI BibTeX RDF
22	Jianhua Wang, Shilei Lu, Yubin Lan, Lianglun Cheng	An Efficient Complex Event Processing Algorithm Based on NFA-HTBTS for Massive RFID Event Stream.	Int. J. Inf. Technol. Syst. Approach	2018	DBLP DOI BibTeX RDF
22	Branislav Rovan, Simon Sádovský	On Usefulness of Information: Framework and NFA Case.	Adventures Between Lower Bounds and Higher Altitudes	2018	DBLP DOI BibTeX RDF
22	Chengcheng Xu, Jinshu Su, Shuhui Chen	Exploring Efficient NFA Data Structures to Accelerate DFA Generation.	ICCSP	2018	DBLP DOI BibTeX RDF
22	Nicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce W. Watson	Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA.	CIAA	2016	DBLP DOI BibTeX RDF
22	Danny Ho, Luiz Fernando Capretz, Xishi Huang, Jing Ren 0003	Neuro-Fuzzy Algorithmic (NFA) Models and Tools for Estimation.	CoRR	2015	DBLP BibTeX RDF
22	Sheng Huo, Dafang Zhang, Yanbiao Li	Fast and Scalable Regular Expressions Matching with Multi-Stride Index NFA.	ICA3PP (3)	2015	DBLP DOI BibTeX RDF
22	Gösta Grahne, Shahab Harrafi, Ali Moallemi, Adrian Onet	Computing NFA Intersections in Map-Reduce.	EDBT/ICDT Workshops	2015	DBLP BibTeX RDF
22	Alexandros Palioudakis, Kai Salomaa, Selim G. Akl	Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.	J. Autom. Lang. Comb.	2014	DBLP DOI BibTeX RDF
22	Vlastimil Kosar, Jan Korenek	On NFA-split architecture optimizations.	DDECS	2014	DBLP DOI BibTeX RDF