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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 199-210, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 488-497, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
120 | Lucian Ilie, Sheng Yu 0001 |
Constructing NFA s by Optimal Use of Positions in Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 279-288, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIN ![In: Proceedings of the 2nd International Conference on Security of Information and Networks, SIN 2009, Gazimagusa, North Cyprus, October 6-10, 2009, pp. 123-127, 2009, ACM, 978-1-60558-412-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings, pp. 152-171, 1991, Springer, 3-540-54967-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
84 | Makoto Onizuka |
Processing XPath queries with forward and downward axes over XML streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings, pp. 27-38, 2010, ACM, 978-1-60558-945-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), Madrid, Spain, August 28-30, 2006, pp. 1-4, 2006, IEEE, 1-4244-0312-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
84 | Sebastian John |
Minimal Unambiguous eNFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 190-201, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2008 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2008, San Jose, California, USA, November 6-7, 2008, pp. 30-39, 2008, ACM, 978-1-60558-346-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: FPL 2008, International Conference on Field Programmable Logic and Applications, Heidelberg, Germany, 8-10 September 2008, pp. 131-136, 2008, IEEE, 978-1-4244-1961-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 34-55, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
78 | Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov |
On a Maximal NFA Without Mergible States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 202-210, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
70 | Markus Holzer 0001, Martin Kutrib |
State Complexity of Basic Operations on Nondeterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers, pp. 148-157, 2002, Springer, 3-540-40391-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
67 | Sylvain Lombardy |
On the Size of the Universal Automaton of a Regular Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 85-96, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Universal Automaton, NFA Minimization, Regular languages |
64 | Heikki Hyyrö |
Tighter Packed Bit-Parallel NFA for Approximate String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 287-289, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
64 | Guangming Xing |
A simple way to construct NFA with fewer states and transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 42nd Annual Southeast Regional Conference, 2004, Huntsville, Alabama, USA, April 2-3, 2004, pp. 214-218, 2004, ACM, 1-58113-870-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
63 | Hao Wang, Shi Pu, Gabriel Knezek, Jyh-Charn Liu |
A modular NFA architecture for regular expression matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 18th International Symposium on Field Programmable Gate Arrays, FPGA 2010, Monterey, California, USA, February 21-23, 2010, pp. 209-218, 2010, ACM, 978-1-60558-911-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 31(4), pp. 755-761, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Makoto Onizuka |
Light-weight xPath processing of XML stream with deterministic automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, New Orleans, Louisiana, USA, November 2-8, 2003, pp. 342-349, 2003, ACM, 1-58113-723-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 144-157, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
50 | Zhiyong Liu, Lei Xu 0001 |
On Convergence of an Iterative Factor Estimate Algorithm for the NFA Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN ![In: Artificial Neural Networks - ICANN 2002, International Conference, Madrid, Spain, August 28-30, 2002, Proceedings, pp. 1025-1030, 2002, Springer, 3-540-44074-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Jan Holub 0001 |
Bit Parallelism - NFA Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001, Revised Papers, pp. 149-160, 2001, Springer, 3-540-00400-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
50 | Christian Hagenah, Anca Muscholl |
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 277-285, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
50 | Tao Jiang 0001, Bala Ravikumar |
Minimal NFA Problems Are Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 629-640, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (1) ![In: Graph-Based Representation and Reasoning - 28th International Conference on Conceptual Structures, ICCS 2023, Berlin, Germany, September 11-13, 2023, Proceedings, pp. 134-147, 2023, Springer, 978-3-031-40959-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 24(3), pp. 1704-1717, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
44 | Arihant Jain |
Equivalence of SDVFA of order (s, t) with DFA, VDFA, NFA and e-NFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 117, pp. 363-373, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
44 | Hing Leung |
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 221-229, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
42 | Margareta Ackerman, Erkki Mäkinen |
Three New Algorithms for Regular Language Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 178-191, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIM ![In: The Ninth International Conference on Web-Age Information Management, WAIM 2008, July 20-22, 2008, Zhangjiajie, China, pp. 127-134, 2008, IEEE Computer Society, 978-0-7695-3185-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (1) ![In: Knowledge-Based Intelligent Information and Engineering Systems, 12th International Conference, KES 2008, Zagreb, Croatia, September 3-5, 2008, Proceedings, Part I, pp. 362-374, 2008, Springer, 978-3-540-85562-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Geoffrey Smith 0001 |
Inductive bases and their application to searches for minimal unary NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 470-475, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Michael Domaratzki, Kai Salomaa |
Lower Bounds for the Transition Complexity of NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 315-326, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Viliam Geffert |
Magic Numbers in the State Hierarchy of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 412-423, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Toshihiro Katashita, Atusi Maeda, Kenji Toda, Yoshinori Yamaguchi |
Highly Efficient String Matching Circuit for IDS with FPGA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCCM ![In: 14th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2006), 24-26 April 2006, Napa, CA, USA, Proceedings, pp. 285-286, 2006, IEEE Computer Society, 0-7695-2661-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Giovanna Melideo, Stefano Varricchio |
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings, pp. 87-102, 1998, Springer, 3-540-65013-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag Johansen |
Distributed event stream processing with non-deterministic finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEBS ![In: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems, DEBS 2009, Nashville, Tennessee, USA, July 6-9, 2009, 2009, ACM, 978-1-60558-665-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
continuous queries, publish-subscribe, event streams, NFA |
36 | Gregor Gramlich, Georg Schnitger |
Minimizing NFA's and Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 399-411, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, Washington, DC, USA, November 8-13, 2004, pp. 543-552, 2004, ACM, 1-58113-874-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
data security and privacy, query rewriting, XML security |
36 | Libor Polák |
Minimalizations of NFA Using the Universal Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 325-326, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Jean-Marc Champarnaud, Fabien Coulon |
NFA Reduction Algorithms by Means of Regular Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings, pp. 194-205, 2003, Springer, 3-540-40434-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Forrest Brewer, Steve Haynal |
Symbolic NFA scheduling of a RISC microprocessor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 10(4), pp. 429-434, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Zhiyong Liu, Lei Xu 0001 |
A Comparative Study on Three MAP Factor Estimate Approaches for NFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAL ![In: Intelligent Data Engineering and Automated Learning - IDEAL 2002, Third International Conference, Manchester, UK, August 12-14, Proceedings, pp. 372-377, 2002, Springer, 3-540-44025-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 46(5), pp. 331-360, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Yuan Mei, Samuel Madden 0001 |
ZStream: a cost-based query processor for adaptively detecting composite events. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, Rhode Island, USA, June 29 - July 2, 2009, pp. 193-206, 2009, ACM, 978-1-60558-551-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 339-358, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Galina Jirásková |
On the State Complexity of Complements, Stars, and Reversals of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 431-442, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Miad Faezipour, Mehrdad Nourani |
Constraint Repetition Inspection for Regular Expression on FPGA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hot Interconnects ![In: 16th Annual IEEE Symposium on High Performance Interconnects (HOTI 2008), 26-28 August 2008, Stanford, CA, USA, pp. 111-118, 2008, IEEE Computer Society, 978-0-7695-3380-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Progress in WWW Research and Development, 10th Asia-Pacific Web Conference, APWeb 2008, Shenyang, China, April 26-28, 2008. Proceedings, pp. 202-213, 2008, Springer, 978-3-540-78848-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
DTD choice, XPath satisfiability, automaton |
28 | Cong Tian, Zhenhua Duan |
Model Checking Propositional Projection Temporal Logic Based on SPIN. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 9th International Conference on Formal Engineering Methods, ICFEM 2007, Boca Raton, FL, USA, November 14-15, 2007, Proceedings, pp. 246-265, 2007, Springer, 978-3-540-76648-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2-4 April 2007, Las Vegas, Nevada, USA, pp. 937-938, 2007, IEEE Computer Society, 978-0-7695-2776-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan |
Compiling PCRE to FPGA for accelerating SNORT IDS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANCS ![In: Proceedings of the 2007 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2007, Orlando, Florida, USA, December 3-4, 2007, pp. 127-136, 2007, ACM, 978-1-59593-945-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 265-274, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Yinglian Xie, Vyas Sekar, Michael K. Reiter, Hui Zhang 0001 |
Forensic Analysis for Epidemic Attacks in Federated Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the 14th IEEE International Conference on Network Protocols, ICNP 2006, November 12-15, 2006, Santa Barbara, California, USA, pp. 43-53, 2006, IEEE Computer Society, 1-4244-0593-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Alan J. Demers, Johannes Gehrke, Mingsheng Hong, Mirek Riedewald, Walker M. White |
Towards Expressive Publish/Subscribe Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: Advances in Database Technology - EDBT 2006, 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006, Proceedings, pp. 627-644, 2006, Springer, 3-540-32960-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Deian Tabakov, Moshe Y. Vardi |
Experimental Evaluation of Classical Automata Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 396-411, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Juraj Hromkovic, Georg Schnitger |
NFAs With and Without epsilon-Transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 385-396, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 158-167, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Lynette van Zijl |
Succinct Descriptions of Regular Languages with Binary +-NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings, pp. 72-82, 2003, Springer, 3-540-40561-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Jan Holub 0001, Borivoj Melichar |
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Implementing Automata ![In: Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers, pp. 92-99, 1998, Springer, 3-540-66652-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Juraj Hromkovic, Sebastian Seibert, Thomas Wilke |
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 55-66, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Valentin M. Antimirov |
Partial Derivates of Regular Expressions and Finite Automata Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 455-466, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Craig A. Rich |
The Complexity of a Counting Finite-State Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings, pp. 225-239, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings, pp. 26-43, 1987, Springer, 3-540-18625-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Andreas Weber, Helmut Seidl |
On the Degree of Ambiguity of Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 620-629, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: International Conference on Field Programmable Logic and Applications, FPL 2011, September 5-7, Chania, Crete, Greece, pp. 157-161, 2011, IEEE Computer Society, 978-1-4577-1484-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 32(4), pp. 722-732, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ReConFig ![In: ReConFig'08: 2008 International Conference on Reconfigurable Computing and FPGAs, 3-5 December 2008, Cancun, Mexico, Proceedings, pp. 73-78, 2008, IEEE Computer Society, 978-0-7695-3474-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT ![In: Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2007, New York, NY, USA, December 10-13, 2007, pp. 1, 2007, ACM, 978-1-59593-770-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 22:1-22:25, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 972, pp. 114076, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Kuldeep S. Meel, Sourav Chakraborty 0001, Umang Mathur 0001 |
A faster FPRAS for #NFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.13320, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.01363, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.10204, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings, pp. 79-93, 2023, Springer, 978-3-031-34325-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CNML ![In: Proceedings of the 2023 International Conference on Communication Network and Machine Learning, CNML 2023, Zhengzhou, China, October 27-28, 2023, pp. 303-307, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.01594, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis |
Approximate NFA Universality Motivated by Information Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings, pp. 142-154, 2022, Springer, 978-3-031-13256-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Brian Riccardi, Riccardo Romanello, Alberto Policriti, Christian Bianchini |
Incremental NFA Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022., pp. 161-173, 2022, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Edith Hemaspaandra, David E. Narváez |
Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CICM ![In: Intelligent Computer Mathematics - 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19-23, 2022, Proceedings, pp. 241-255, 2022, Springer, 978-3-031-16680-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 68(6), pp. 48:1-48:40, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Frédéric Lardeux, Éric Monfroy |
GA and ILS for optimizing the size of NFA models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.05877, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Frédéric Lardeux, Éric Monfroy |
Improved SAT models for NFA learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.06672, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Kamil Sert, Cüneyt F. Bazlamaçci |
NFA Based Regular Expression Matching on FPGA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CITS ![In: International Conference on Computer, Information and Telecommunication Systems, CITS 2021, Istanbul, Turkey, November 11-13, 2021, pp. 1-5, 2021, IEEE, 978-1-6654-4913-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Frédéric Lardeux, Éric Monfroy |
Improved SAT Models for NFA Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OLA ![In: Optimization and Learning - 4th International Conference, OLA 2021, Catania, Italy, June 21-23, 2021, Proceedings, pp. 267-279, 2021, Springer, 978-3-030-85671-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Hannah Miller, David E. Narváez |
Toward Determining NFA Equivalence via QBFs (Student Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 15849-15850, 2021, AAAI Press, 978-1-57735-866-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Frédéric Lardeux, Éric Monfroy |
Optimized models and symmetry breaking for the NFA inference problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2021, Washington, DC, USA, November 1-3, 2021, pp. 396-403, 2021, IEEE, 978-1-6654-0898-1. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 4, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Galina Jirásková, Ivana Krajnáková |
NFA-to-DFA Trade-Off for Regular Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCFS ![In: Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings, pp. 184-196, 2019, Springer, 978-3-030-23246-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Tomasz Jastrzab |
On Superlinear Speedups of a Parallel NFA Induction Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARCO ![In: Parallel Computing: Technology Trends, Proceedings of the International Conference on Parallel Computing, PARCO 2019, Prague, Czech Republic, September 10-13, 2019, pp. 179-188, 2019, IOS Press, 978-1-64368-070-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Tomasz Jastrzab |
A Comparison of Selected Variable Ordering Methods for NFA Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (5) ![In: Computational Science - ICCS 2019 - 19th International Conference, Faro, Portugal, June 12-14, 2019, Proceedings, Part V, pp. 741-748, 2019, Springer, 978-3-030-22749-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Technol. Syst. Approach ![In: Int. J. Inf. Technol. Syst. Approach 11(2), pp. 18-30, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Branislav Rovan, Simon Sádovský |
On Usefulness of Information: Framework and NFA Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adventures Between Lower Bounds and Higher Altitudes ![In: Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pp. 85-99, 2018, Springer, 978-3-319-98354-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Chengcheng Xu, Jinshu Su, Shuhui Chen |
Exploring Efficient NFA Data Structures to Accelerate DFA Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSP ![In: Proceedings of the 2nd International Conference on Cryptography, Security and Privacy, ICCSP 2018, Guiyang, China, March 16-19, 2018, pp. 56-61, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings, pp. 322-334, 2016, Springer, 978-3-319-40945-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.00037, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Sheng Huo, Dafang Zhang, Yanbiao Li |
Fast and Scalable Regular Expressions Matching with Multi-Stride Index NFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP (3) ![In: Algorithms and Architectures for Parallel Processing - 15th International Conference, ICA3PP 2015, Zhangjiajie, China, November 18-20, 2015. Proceedings, Part III, pp. 597-610, 2015, Springer, 978-3-319-27136-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Gösta Grahne, Shahab Harrafi, Ali Moallemi, Adrian Onet |
Computing NFA Intersections in Map-Reduce. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT/ICDT Workshops ![In: Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015., pp. 42-45, 2015, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Alexandros Palioudakis, Kai Salomaa, Selim G. Akl |
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Lang. Comb. ![In: J. Autom. Lang. Comb. 19(1-4), pp. 251-264, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Vlastimil Kosar, Jan Korenek |
On NFA-split architecture optimizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DDECS ![In: 17th International Symposium on Design and Diagnostics of Electronic Circuits & Systems, DDECS 2014, Warsaw, Poland, 23-25 April, 2014, pp. 274-277, 2014, IEEE Computer Society, 978-1-4799-4560-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|