17 papers:
POPL-2013-BonchiP #automaton #bisimulation #congruence #equivalence #nondeterminism- Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
PPoPP-2012-ZuYXWTPD #automaton #implementation #memory management #nondeterminism #performance #regular expression- GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
CIAA-2010-CimattiMRT #automaton #nondeterminism #regular expression- From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.
DLT-2008-HromkovicS #automaton #bound #nondeterminism #on the #proving- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (JH, GS), pp. 34–55.
ICALP-B-2008-BjorklundM #automaton #nondeterminism- The Tractability Frontier for NFA Minimization (HB, WM), pp. 27–38.
LATA-2007-GruberH #automaton #complexity #finite #nondeterminism- Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
- CIAA-2006-Hyyro #approximate #automaton #nondeterminism #string
- Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.
- CIAA-2004-CampeanuP #automaton #bound #nondeterminism
- Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.
- CIAA-2004-Polak #automaton #nondeterminism #using
- Minimalizations of NFA Using the Universal Automaton (LP), pp. 325–326.
CIKM-2004-LuoLLL #data access #fine-grained #named #query #runtime #xml- QFilter: fine-grained run-time XML access control via NFA-based query rewriting (BL, DL, WCL, PL), pp. 543–552.
- DLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction
- NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
- CIAA-2002-Holub #automaton #nondeterminism #programming #simulation
- Dynamic Programming — NFA Simulation (JH), pp. 295–300.
- CIAA-2001-Holub #automaton #nondeterminism #parallel #simulation
- Bit Parallelism — NFA Simulation (JH), pp. 149–160.
- CIAA-2000-Champarnaud #automaton #nondeterminism #regular expression
- Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.
- DLT-1997-IwamaT #automaton #bound #nondeterminism
- Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.
- WIA-1996-SalomaaY #automaton #finite #nondeterminism
- NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.
- ICALP-1991-JiangR #automaton #nondeterminism #problem
- Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.
