id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ap-1008	Holub, J.	Finite Automata Implementations Considering CPU Cache	2007	5	.pdf	application/pdf	3411	227	69	However, it may lead to an exponential increase of number of states (2Q NFA states, where QNFA is the number of states of the original NFA). 2 Nondeterministic finite automaton Nondeterministic finite automaton (NFA) is a quintuple (Q, �, �, q0, F), where Q is a finite set of states, � is a set of input sym- bols, � is a mapping � �Q Q� ( ) ( )� � �� � , q Q0 � is an initial state, and F Q� is a set of final states.	cache/ap-1008.pdf	txt/ap-1008.txt