id	sid	tid	token	lemma	pos
ap-1008	1	1	ap_07_6.vp	ap_07_6.vp	PROPN
ap-1008	1	2	1	1	NUM
ap-1008	1	3	introduction	introduction	NOUN
ap-1008	1	4	the	the	DET
ap-1008	1	5	original	original	ADJ
ap-1008	1	6	formal	formal	ADJ
ap-1008	1	7	study	study	NOUN
ap-1008	1	8	of	of	ADP
ap-1008	1	9	finite	finite	ADJ
ap-1008	1	10	state	state	NOUN
ap-1008	1	11	systems	system	NOUN
ap-1008	1	12	(	(	PUNCT
ap-1008	1	13	neural	neural	ADJ
ap-1008	1	14	nets	net	NOUN
ap-1008	1	15	)	)	PUNCT
ap-1008	1	16	is	be	AUX
ap-1008	1	17	from	from	ADP
ap-1008	1	18	1943	1943	NUM
ap-1008	1	19	by	by	ADP
ap-1008	1	20	mcculloch	mcculloch	NOUN
ap-1008	1	21	and	and	CCONJ
ap-1008	1	22	pitts	pitt	NOUN
ap-1008	1	23	[	[	X
ap-1008	1	24	14	14	NUM
ap-1008	1	25	]	]	PUNCT
ap-1008	1	26	.	.	PUNCT
ap-1008	2	1	in	in	ADP
ap-1008	2	2	1956	1956	NUM
ap-1008	2	3	kleene	kleene	NOUN
ap-1008	2	4	[	[	X
ap-1008	2	5	13	13	NUM
ap-1008	2	6	]	]	PUNCT
ap-1008	2	7	modeled	model	VERB
ap-1008	2	8	the	the	DET
ap-1008	2	9	neural	neural	ADJ
ap-1008	2	10	nets	net	NOUN
ap-1008	2	11	of	of	ADP
ap-1008	2	12	mcculloch	mcculloch	NOUN
ap-1008	2	13	and	and	CCONJ
ap-1008	2	14	pitts	pitt	NOUN
ap-1008	2	15	by	by	ADP
ap-1008	2	16	finite	finite	ADJ
ap-1008	2	17	automata	automata	NOUN
ap-1008	2	18	.	.	PUNCT
ap-1008	3	1	in	in	ADP
ap-1008	3	2	that	that	DET
ap-1008	3	3	time	time	NOUN
ap-1008	3	4	similar	similar	ADJ
ap-1008	3	5	models	model	NOUN
ap-1008	3	6	were	be	AUX
ap-1008	3	7	presented	present	VERB
ap-1008	3	8	by	by	ADP
ap-1008	3	9	huffman	huffman	PROPN
ap-1008	4	1	[	[	X
ap-1008	4	2	12	12	NUM
ap-1008	4	3	]	]	PUNCT
ap-1008	4	4	,	,	PUNCT
ap-1008	4	5	moore	moore	PROPN
ap-1008	5	1	[	[	X
ap-1008	5	2	17	17	NUM
ap-1008	5	3	]	]	PUNCT
ap-1008	5	4	,	,	PUNCT
ap-1008	5	5	and	and	CCONJ
ap-1008	5	6	mealy	mealy	ADJ
ap-1008	6	1	[	[	X
ap-1008	6	2	15	15	NUM
ap-1008	6	3	]	]	PUNCT
ap-1008	6	4	.	.	PUNCT
ap-1008	7	1	in	in	ADP
ap-1008	7	2	1959	1959	NUM
ap-1008	7	3	,	,	PUNCT
ap-1008	7	4	rabin	rabin	PROPN
ap-1008	7	5	and	and	CCONJ
ap-1008	7	6	scott	scott	PROPN
ap-1008	7	7	introduced	introduce	VERB
ap-1008	7	8	nondeterministic	nondeterministic	ADJ
ap-1008	7	9	finite	finite	ADJ
ap-1008	7	10	automata	automata	NOUN
ap-1008	7	11	(	(	PUNCT
ap-1008	7	12	nfa	nfa	PROPN
ap-1008	7	13	)	)	PUNCT
ap-1008	7	14	in	in	ADP
ap-1008	7	15	[	[	X
ap-1008	7	16	21	21	NUM
ap-1008	7	17	]	]	PUNCT
ap-1008	7	18	.	.	PUNCT
ap-1008	8	1	the	the	DET
ap-1008	8	2	finite	finite	PROPN
ap-1008	8	3	automata	automata	NOUN
ap-1008	8	4	theory	theory	NOUN
ap-1008	8	5	is	be	AUX
ap-1008	8	6	a	a	DET
ap-1008	8	7	well	well	ADV
ap-1008	8	8	developed	develop	VERB
ap-1008	8	9	theory	theory	NOUN
ap-1008	8	10	.	.	PUNCT
ap-1008	9	1	it	it	PRON
ap-1008	9	2	deals	deal	VERB
ap-1008	9	3	with	with	ADP
ap-1008	9	4	regular	regular	ADJ
ap-1008	9	5	languages	language	NOUN
ap-1008	9	6	,	,	PUNCT
ap-1008	9	7	regular	regular	ADJ
ap-1008	9	8	expressions	expression	NOUN
ap-1008	9	9	,	,	PUNCT
ap-1008	9	10	regular	regular	ADJ
ap-1008	9	11	grammars	grammar	NOUN
ap-1008	9	12	,	,	PUNCT
ap-1008	9	13	nfas	nfas	ADJ
ap-1008	9	14	,	,	PUNCT
ap-1008	9	15	deterministic	deterministic	ADJ
ap-1008	9	16	finite	finite	NOUN
ap-1008	9	17	automata	automata	NOUN
ap-1008	9	18	(	(	PUNCT
ap-1008	9	19	dfas	dfas	PROPN
ap-1008	9	20	)	)	PUNCT
ap-1008	9	21	,	,	PUNCT
ap-1008	9	22	and	and	CCONJ
ap-1008	9	23	various	various	ADJ
ap-1008	9	24	transformations	transformation	NOUN
ap-1008	9	25	among	among	ADP
ap-1008	9	26	the	the	DET
ap-1008	9	27	previously	previously	ADV
ap-1008	9	28	listed	list	VERB
ap-1008	9	29	formalisms	formalism	NOUN
ap-1008	9	30	.	.	PUNCT
ap-1008	10	1	the	the	DET
ap-1008	10	2	final	final	ADJ
ap-1008	10	3	product	product	NOUN
ap-1008	10	4	of	of	ADP
ap-1008	10	5	the	the	DET
ap-1008	10	6	theory	theory	NOUN
ap-1008	10	7	towards	towards	ADP
ap-1008	10	8	practical	practical	ADJ
ap-1008	10	9	implementation	implementation	NOUN
ap-1008	10	10	is	be	AUX
ap-1008	10	11	a	a	DET
ap-1008	10	12	dfa	dfa	PROPN
ap-1008	10	13	.	.	PROPN
ap-1008	10	14	dfa	dfa	PROPN
ap-1008	10	15	then	then	ADV
ap-1008	10	16	runs	run	VERB
ap-1008	10	17	theoretically	theoretically	ADV
ap-1008	10	18	in	in	ADP
ap-1008	10	19	time	time	NOUN
ap-1008	10	20	�	�	PROPN
ap-1008	10	21	(	(	PUNCT
ap-1008	10	22	n	n	CCONJ
ap-1008	10	23	)	)	PUNCT
ap-1008	10	24	,	,	PUNCT
ap-1008	10	25	where	where	SCONJ
ap-1008	10	26	n	n	PRON
ap-1008	10	27	is	be	AUX
ap-1008	10	28	the	the	DET
ap-1008	10	29	size	size	NOUN
ap-1008	10	30	of	of	ADP
ap-1008	10	31	the	the	DET
ap-1008	10	32	input	input	NOUN
ap-1008	10	33	text	text	NOUN
ap-1008	10	34	.	.	PUNCT
ap-1008	11	1	however	however	ADV
ap-1008	11	2	,	,	PUNCT
ap-1008	11	3	in	in	ADP
ap-1008	11	4	practice	practice	NOUN
ap-1008	11	5	we	we	PRON
ap-1008	11	6	have	have	VERB
ap-1008	11	7	to	to	PART
ap-1008	11	8	consider	consider	VERB
ap-1008	11	9	cpu	cpu	VERB
ap-1008	11	10	cache	cache	NOUN
ap-1008	11	11	that	that	PRON
ap-1008	11	12	rapidly	rapidly	ADV
ap-1008	11	13	influences	influence	VERB
ap-1008	11	14	the	the	DET
ap-1008	11	15	speed	speed	NOUN
ap-1008	11	16	.	.	PUNCT
ap-1008	12	1	cpu	cpu	NOUN
ap-1008	12	2	has	have	VERB
ap-1008	12	3	two	two	NUM
ap-1008	12	4	level	level	NOUN
ap-1008	12	5	caches	cache	NOUN
ap-1008	12	6	displayed	display	VERB
ap-1008	12	7	in	in	ADP
ap-1008	12	8	fig	fig	NOUN
ap-1008	12	9	.	.	PUNCT
ap-1008	13	1	1	1	X
ap-1008	13	2	.	.	X
ap-1008	14	1	the	the	DET
ap-1008	14	2	level	level	NOUN
ap-1008	14	3	1	1	NUM
ap-1008	14	4	(	(	PUNCT
ap-1008	14	5	l1	l1	PROPN
ap-1008	14	6	)	)	PUNCT
ap-1008	14	7	cache	cache	NOUN
ap-1008	14	8	is	be	AUX
ap-1008	14	9	located	locate	VERB
ap-1008	14	10	on	on	ADP
ap-1008	14	11	chip	chip	NOUN
ap-1008	14	12	.	.	PUNCT
ap-1008	15	1	it	it	PRON
ap-1008	15	2	takes	take	VERB
ap-1008	15	3	about	about	ADV
ap-1008	15	4	2–3	2–3	NUM
ap-1008	15	5	cpu	cpu	NOUN
ap-1008	15	6	cycles	cycle	NOUN
ap-1008	15	7	to	to	PART
ap-1008	15	8	access	access	VERB
ap-1008	15	9	data	datum	NOUN
ap-1008	15	10	in	in	ADP
ap-1008	15	11	l1	l1	PROPN
ap-1008	15	12	cache	cache	PROPN
ap-1008	15	13	.	.	PUNCT
ap-1008	16	1	the	the	DET
ap-1008	16	2	level	level	NOUN
ap-1008	16	3	2	2	NUM
ap-1008	16	4	(	(	PUNCT
ap-1008	16	5	l2	l2	NOUN
ap-1008	16	6	)	)	PUNCT
ap-1008	16	7	cache	cache	NOUN
ap-1008	16	8	may	may	AUX
ap-1008	16	9	be	be	AUX
ap-1008	16	10	on	on	ADP
ap-1008	16	11	chip	chip	NOUN
ap-1008	16	12	or	or	CCONJ
ap-1008	16	13	may	may	AUX
ap-1008	16	14	be	be	AUX
ap-1008	16	15	external	external	ADJ
ap-1008	16	16	.	.	PUNCT
ap-1008	17	1	it	it	PRON
ap-1008	17	2	has	have	VERB
ap-1008	17	3	about	about	ADV
ap-1008	17	4	10	10	NUM
ap-1008	17	5	cycles	cycle	NOUN
ap-1008	17	6	access	access	NOUN
ap-1008	17	7	time	time	NOUN
ap-1008	17	8	.	.	PUNCT
ap-1008	18	1	the	the	DET
ap-1008	18	2	main	main	ADJ
ap-1008	18	3	memory	memory	NOUN
ap-1008	18	4	access	access	NOUN
ap-1008	18	5	takes	take	VERB
ap-1008	18	6	150–200	150–200	NUM
ap-1008	18	7	cycles	cycle	NOUN
ap-1008	18	8	and	and	CCONJ
ap-1008	18	9	hard	hard	ADJ
ap-1008	18	10	disc	disc	NOUN
ap-1008	18	11	drive	drive	NOUN
ap-1008	18	12	access	access	NOUN
ap-1008	18	13	takes	take	VERB
ap-1008	18	14	even	even	ADV
ap-1008	18	15	106	106	NUM
ap-1008	18	16	times	time	NOUN
ap-1008	18	17	more	more	ADJ
ap-1008	18	18	time	time	NOUN
ap-1008	18	19	.	.	PUNCT
ap-1008	19	1	therefore	therefore	ADV
ap-1008	19	2	it	it	PRON
ap-1008	19	3	is	be	AUX
ap-1008	19	4	obvious	obvious	ADJ
ap-1008	19	5	that	that	SCONJ
ap-1008	19	6	cpu	cpu	NOUN
ap-1008	19	7	cache	cache	NOUN
ap-1008	19	8	significantly	significantly	ADV
ap-1008	19	9	influences	influence	VERB
ap-1008	19	10	dfa	dfa	PROPN
ap-1008	19	11	run	run	NOUN
ap-1008	19	12	.	.	PUNCT
ap-1008	20	1	we	we	PRON
ap-1008	20	2	can	can	AUX
ap-1008	20	3	not	not	PART
ap-1008	20	4	control	control	VERB
ap-1008	20	5	the	the	DET
ap-1008	20	6	cpu	cpu	NOUN
ap-1008	20	7	cache	cache	NOUN
ap-1008	20	8	use	use	NOUN
ap-1008	20	9	directly	directly	ADV
ap-1008	20	10	,	,	PUNCT
ap-1008	20	11	but	but	CCONJ
ap-1008	20	12	knowing	know	VERB
ap-1008	20	13	the	the	DET
ap-1008	20	14	cpu	cpu	ADJ
ap-1008	20	15	cache	cache	NOUN
ap-1008	20	16	strategies	strategy	NOUN
ap-1008	20	17	we	we	PRON
ap-1008	20	18	can	can	AUX
ap-1008	20	19	implement	implement	VERB
ap-1008	20	20	the	the	DET
ap-1008	20	21	dfa	dfa	NOUN
ap-1008	20	22	run	run	VERB
ap-1008	20	23	in	in	ADP
ap-1008	20	24	a	a	DET
ap-1008	20	25	way	way	NOUN
ap-1008	20	26	so	so	SCONJ
ap-1008	20	27	that	that	PRON
ap-1008	20	28	cpu	cpu	NOUN
ap-1008	20	29	cache	cache	NOUN
ap-1008	20	30	would	would	AUX
ap-1008	20	31	be	be	AUX
ap-1008	20	32	most	most	ADV
ap-1008	20	33	likely	likely	ADV
ap-1008	20	34	efficiently	efficiently	ADV
ap-1008	20	35	used	use	VERB
ap-1008	20	36	.	.	PUNCT
ap-1008	21	1	we	we	PRON
ap-1008	21	2	distinguish	distinguish	VERB
ap-1008	21	3	two	two	NUM
ap-1008	21	4	kinds	kind	NOUN
ap-1008	21	5	of	of	ADP
ap-1008	21	6	use	use	NOUN
ap-1008	21	7	of	of	ADP
ap-1008	21	8	dfa	dfa	PROPN
ap-1008	21	9	.	.	PROPN
ap-1008	22	1	for	for	ADP
ap-1008	22	2	each	each	PRON
ap-1008	22	3	of	of	ADP
ap-1008	22	4	them	they	PRON
ap-1008	22	5	we	we	PRON
ap-1008	22	6	describe	describe	VERB
ap-1008	22	7	the	the	DET
ap-1008	22	8	most	most	ADV
ap-1008	22	9	suitable	suitable	ADJ
ap-1008	22	10	implementation	implementation	NOUN
ap-1008	22	11	.	.	PUNCT
ap-1008	23	1	in	in	ADP
ap-1008	23	2	section	section	NOUN
ap-1008	23	3	2	2	NUM
ap-1008	23	4	we	we	PRON
ap-1008	23	5	define	define	VERB
ap-1008	23	6	nondeterministic	nondeterministic	ADJ
ap-1008	23	7	finite	finite	ADJ
ap-1008	23	8	automaton	automaton	NOUN
ap-1008	23	9	and	and	CCONJ
ap-1008	23	10	discuss	discuss	VERB
ap-1008	23	11	its	its	PRON
ap-1008	23	12	usage	usage	NOUN
ap-1008	23	13	.	.	PUNCT
ap-1008	24	1	section	section	NOUN
ap-1008	24	2	3	3	NUM
ap-1008	24	3	then	then	ADV
ap-1008	24	4	describes	describe	VERB
ap-1008	24	5	general	general	ADJ
ap-1008	24	6	techniques	technique	NOUN
ap-1008	24	7	for	for	ADP
ap-1008	24	8	dfa	dfa	NOUN
ap-1008	24	9	implementation	implementation	NOUN
ap-1008	24	10	.	.	PUNCT
ap-1008	25	1	it	it	PRON
ap-1008	25	2	is	be	AUX
ap-1008	25	3	mostly	mostly	ADV
ap-1008	25	4	suitable	suitable	ADJ
ap-1008	25	5	for	for	ADP
ap-1008	25	6	dfa	dfa	PROPN
ap-1008	25	7	that	that	PRON
ap-1008	25	8	is	be	AUX
ap-1008	25	9	run	run	VERB
ap-1008	25	10	most	most	ADJ
ap-1008	25	11	of	of	ADP
ap-1008	25	12	the	the	DET
ap-1008	25	13	time	time	NOUN
ap-1008	25	14	.	.	PUNCT
ap-1008	26	1	since	since	SCONJ
ap-1008	26	2	dfa	dfa	PROPN
ap-1008	26	3	has	have	VERB
ap-1008	26	4	a	a	DET
ap-1008	26	5	finite	finite	ADJ
ap-1008	26	6	set	set	NOUN
ap-1008	26	7	of	of	ADP
ap-1008	26	8	states	state	NOUN
ap-1008	26	9	,	,	PUNCT
ap-1008	26	10	this	this	DET
ap-1008	26	11	kind	kind	NOUN
ap-1008	26	12	of	of	ADP
ap-1008	26	13	dfa	dfa	NOUN
ap-1008	26	14	has	have	VERB
ap-1008	26	15	to	to	PART
ap-1008	26	16	have	have	VERB
ap-1008	26	17	cycles	cycle	NOUN
ap-1008	26	18	.	.	PUNCT
ap-1008	27	1	recent	recent	ADJ
ap-1008	27	2	results	result	NOUN
ap-1008	27	3	in	in	ADP
ap-1008	27	4	the	the	DET
ap-1008	27	5	implementation	implementation	NOUN
ap-1008	27	6	using	use	VERB
ap-1008	27	7	cpu	cpu	NOUN
ap-1008	27	8	cache	cache	NOUN
ap-1008	27	9	are	be	AUX
ap-1008	27	10	discussed	discuss	VERB
ap-1008	27	11	in	in	ADP
ap-1008	27	12	section	section	NOUN
ap-1008	27	13	4	4	NUM
ap-1008	27	14	.	.	PUNCT
ap-1008	28	1	on	on	ADP
ap-1008	28	2	the	the	DET
ap-1008	28	3	other	other	ADJ
ap-1008	28	4	hand	hand	NOUN
ap-1008	28	5	we	we	PRON
ap-1008	28	6	have	have	VERB
ap-1008	28	7	a	a	DET
ap-1008	28	8	collection	collection	NOUN
ap-1008	28	9	of	of	ADP
ap-1008	28	10	dfas	dfas	PROPN
ap-1008	28	11	each	each	PRON
ap-1008	28	12	representing	represent	VERB
ap-1008	28	13	some	some	DET
ap-1008	28	14	document	document	NOUN
ap-1008	28	15	(	(	PUNCT
ap-1008	28	16	e.g.	e.g.	ADV
ap-1008	28	17	,	,	PUNCT
ap-1008	28	18	in	in	ADP
ap-1008	28	19	the	the	DET
ap-1008	28	20	form	form	NOUN
ap-1008	28	21	of	of	ADP
ap-1008	28	22	complete	complete	ADJ
ap-1008	28	23	index	index	NOUN
ap-1008	28	24	in	in	ADP
ap-1008	28	25	case	case	NOUN
ap-1008	28	26	of	of	ADP
ap-1008	28	27	factor	factor	NOUN
ap-1008	28	28	or	or	CCONJ
ap-1008	28	29	suffix	suffix	NOUN
ap-1008	28	30	automata	automata	NOUN
ap-1008	28	31	)	)	PUNCT
ap-1008	28	32	.	.	PUNCT
ap-1008	29	1	such	such	ADJ
ap-1008	29	2	dfa	dfa	PROPN
ap-1008	29	3	is	be	AUX
ap-1008	29	4	used	use	VERB
ap-1008	29	5	only	only	ADV
ap-1008	29	6	when	when	SCONJ
ap-1008	29	7	properties	property	NOUN
ap-1008	29	8	of	of	ADP
ap-1008	29	9	the	the	DET
ap-1008	29	10	corresponding	corresponding	ADJ
ap-1008	29	11	document	document	NOUN
ap-1008	29	12	are	be	AUX
ap-1008	29	13	examined	examine	VERB
ap-1008	29	14	.	.	PUNCT
ap-1008	30	1	such	such	ADJ
ap-1008	30	2	automaton	automaton	NOUN
ap-1008	30	3	usually	usually	ADV
ap-1008	30	4	does	do	AUX
ap-1008	30	5	not	not	PART
ap-1008	30	6	have	have	VERB
ap-1008	30	7	cycles	cycle	NOUN
ap-1008	30	8	.	.	PUNCT
ap-1008	31	1	there	there	PRON
ap-1008	31	2	are	be	VERB
ap-1008	31	3	different	different	ADJ
ap-1008	31	4	requirements	requirement	NOUN
ap-1008	31	5	for	for	ADP
ap-1008	31	6	implementation	implementation	NOUN
ap-1008	31	7	of	of	ADP
ap-1008	31	8	such	such	ADJ
ap-1008	31	9	dfa	dfa	PROPN
ap-1008	31	10	.	.	PROPN
ap-1008	31	11	suitable	suitable	ADJ
ap-1008	31	12	implementations	implementation	NOUN
ap-1008	31	13	are	be	AUX
ap-1008	31	14	described	describe	VERB
ap-1008	31	15	in	in	ADP
ap-1008	31	16	section	section	NOUN
ap-1008	31	17	5	5	NUM
ap-1008	31	18	.	.	SYM
ap-1008	31	19	2	2	NUM
ap-1008	31	20	nondeterministic	nondeterministic	ADJ
ap-1008	31	21	finite	finite	ADJ
ap-1008	31	22	automaton	automaton	PROPN
ap-1008	31	23	nondeterministic	nondeterministic	ADJ
ap-1008	31	24	finite	finite	PROPN
ap-1008	31	25	automaton	automaton	PROPN
ap-1008	31	26	(	(	PUNCT
ap-1008	31	27	nfa	nfa	PROPN
ap-1008	31	28	)	)	PUNCT
ap-1008	31	29	is	be	AUX
ap-1008	31	30	a	a	DET
ap-1008	31	31	quintuple	quintuple	ADJ
ap-1008	31	32	(	(	PUNCT
ap-1008	31	33	q	q	NOUN
ap-1008	31	34	,	,	PUNCT
ap-1008	31	35	�	�	PROPN
ap-1008	31	36	,	,	PUNCT
ap-1008	31	37	�	�	PROPN
ap-1008	31	38	,	,	PUNCT
ap-1008	31	39	q0	q0	NOUN
ap-1008	31	40	,	,	PUNCT
ap-1008	31	41	f	f	PROPN
ap-1008	31	42	)	)	PUNCT
ap-1008	31	43	,	,	PUNCT
ap-1008	31	44	where	where	SCONJ
ap-1008	31	45	q	q	NOUN
ap-1008	31	46	is	be	AUX
ap-1008	31	47	a	a	DET
ap-1008	31	48	finite	finite	ADJ
ap-1008	31	49	set	set	NOUN
ap-1008	31	50	of	of	ADP
ap-1008	31	51	states	state	NOUN
ap-1008	31	52	,	,	PUNCT
ap-1008	31	53	�	�	PROPN
ap-1008	31	54	is	be	AUX
ap-1008	31	55	a	a	DET
ap-1008	31	56	set	set	NOUN
ap-1008	31	57	of	of	ADP
ap-1008	31	58	input	input	NOUN
ap-1008	31	59	symbols	symbol	NOUN
ap-1008	31	60	,	,	PUNCT
ap-1008	31	61	�	�	PROPN
ap-1008	31	62	is	be	AUX
ap-1008	31	63	a	a	DET
ap-1008	31	64	mapping	map	VERB
ap-1008	31	65	�	�	PROPN
ap-1008	31	66	�	�	PROPN
ap-1008	31	67	q	q	PROPN
ap-1008	31	68	q	q	PROPN
ap-1008	31	69	�	�	PROPN
ap-1008	31	70	(	(	PUNCT
ap-1008	31	71	)	)	PUNCT
ap-1008	31	72	(	(	PUNCT
ap-1008	31	73	)	)	PUNCT
ap-1008	31	74	�	�	PROPN
ap-1008	31	75	�	�	PROPN
ap-1008	31	76	�	�	PROPN
ap-1008	31	77	�	�	PROPN
ap-1008	31	78	�	�	PROPN
ap-1008	31	79	,	,	PUNCT
ap-1008	31	80	q	q	PROPN
ap-1008	31	81	q0	q0	PROPN
ap-1008	31	82	�	�	PROPN
ap-1008	31	83	is	be	AUX
ap-1008	31	84	an	an	DET
ap-1008	31	85	initial	initial	ADJ
ap-1008	31	86	state	state	NOUN
ap-1008	31	87	,	,	PUNCT
ap-1008	31	88	and	and	CCONJ
ap-1008	31	89	f	f	PROPN
ap-1008	31	90	q	q	PROPN
ap-1008	31	91	�	�	PROPN
ap-1008	31	92	is	be	AUX
ap-1008	31	93	a	a	DET
ap-1008	31	94	set	set	NOUN
ap-1008	31	95	of	of	ADP
ap-1008	31	96	final	final	ADJ
ap-1008	31	97	states	state	NOUN
ap-1008	31	98	.	.	PUNCT
ap-1008	32	1	deterministic	deterministic	ADJ
ap-1008	32	2	finite	finite	PROPN
ap-1008	32	3	automaton	automaton	PROPN
ap-1008	32	4	(	(	PUNCT
ap-1008	32	5	dfa	dfa	PROPN
ap-1008	32	6	)	)	PUNCT
ap-1008	32	7	is	be	AUX
ap-1008	32	8	a	a	DET
ap-1008	32	9	special	special	ADJ
ap-1008	32	10	case	case	NOUN
ap-1008	32	11	of	of	ADP
ap-1008	32	12	nfa	nfa	PROPN
ap-1008	32	13	,	,	PUNCT
ap-1008	32	14	where	where	SCONJ
ap-1008	32	15	�	�	PROPN
ap-1008	32	16	is	be	AUX
ap-1008	32	17	a	a	DET
ap-1008	32	18	mapping	mapping	NOUN
ap-1008	32	19	q	q	NOUN
ap-1008	32	20	q	q	PROPN
ap-1008	32	21	�	�	PROPN
ap-1008	32	22	�	�	PROPN
ap-1008	32	23	�	�	PROPN
ap-1008	32	24	.	.	PUNCT
ap-1008	33	1	in	in	ADP
ap-1008	33	2	the	the	DET
ap-1008	33	3	previous	previous	ADJ
ap-1008	33	4	definition	definition	NOUN
ap-1008	33	5	we	we	PRON
ap-1008	33	6	talk	talk	VERB
ap-1008	33	7	about	about	ADP
ap-1008	33	8	completely	completely	ADV
ap-1008	33	9	defined	define	VERB
ap-1008	33	10	dfa	dfa	NOUN
ap-1008	33	11	,	,	PUNCT
ap-1008	33	12	where	where	SCONJ
ap-1008	33	13	there	there	PRON
ap-1008	33	14	is	be	VERB
ap-1008	33	15	for	for	ADP
ap-1008	33	16	each	each	DET
ap-1008	33	17	source	source	NOUN
ap-1008	33	18	state	state	NOUN
ap-1008	33	19	and	and	CCONJ
ap-1008	33	20	each	each	DET
ap-1008	33	21	input	input	NOUN
ap-1008	33	22	symbol	symbol	NOUN
ap-1008	33	23	exactly	exactly	ADV
ap-1008	33	24	one	one	NUM
ap-1008	33	25	destination	destination	NOUN
ap-1008	33	26	state	state	NOUN
ap-1008	33	27	defined	define	VERB
ap-1008	33	28	.	.	PUNCT
ap-1008	34	1	however	however	ADV
ap-1008	34	2	,	,	PUNCT
ap-1008	34	3	there	there	PRON
ap-1008	34	4	is	be	VERB
ap-1008	34	5	also	also	ADV
ap-1008	34	6	partially	partially	ADV
ap-1008	34	7	defined	define	VERB
ap-1008	34	8	dfa	dfa	NOUN
ap-1008	34	9	,	,	PUNCT
ap-1008	34	10	where	where	SCONJ
ap-1008	34	11	there	there	PRON
ap-1008	34	12	is	be	VERB
ap-1008	34	13	for	for	ADP
ap-1008	34	14	each	each	DET
ap-1008	34	15	source	source	NOUN
ap-1008	34	16	state	state	NOUN
ap-1008	34	17	and	and	CCONJ
ap-1008	34	18	each	each	DET
ap-1008	34	19	input	input	NOUN
ap-1008	34	20	symbol	symbol	NOUN
ap-1008	34	21	at	at	ADP
ap-1008	34	22	most	most	ADV
ap-1008	34	23	one	one	NUM
ap-1008	34	24	destination	destination	NOUN
ap-1008	34	25	state	state	NOUN
ap-1008	34	26	defined	define	VERB
ap-1008	34	27	.	.	PUNCT
ap-1008	35	1	the	the	DET
ap-1008	35	2	partially	partially	ADV
ap-1008	35	3	defined	define	VERB
ap-1008	35	4	dfa	dfa	NOUN
ap-1008	35	5	can	can	AUX
ap-1008	35	6	be	be	AUX
ap-1008	35	7	transformed	transform	VERB
ap-1008	35	8	to	to	ADP
ap-1008	35	9	completely	completely	ADV
ap-1008	35	10	defined	define	VERB
ap-1008	35	11	dfa	dfa	NOUN
ap-1008	35	12	introducing	introduce	VERB
ap-1008	35	13	a	a	DET
ap-1008	35	14	new	new	ADJ
ap-1008	35	15	state	state	NOUN
ap-1008	35	16	(	(	PUNCT
ap-1008	35	17	so	so	ADV
ap-1008	35	18	called	call	VERB
ap-1008	35	19	sink	sink	PROPN
ap-1008	35	20	state	state	PROPN
ap-1008	35	21	)	)	PUNCT
ap-1008	35	22	which	which	PRON
ap-1008	35	23	has	have	VERB
ap-1008	35	24	a	a	DET
ap-1008	35	25	self	self	NOUN
ap-1008	35	26	loop	loop	NOUN
ap-1008	35	27	for	for	ADP
ap-1008	35	28	each	each	DET
ap-1008	35	29	symbol	symbol	NOUN
ap-1008	35	30	of	of	ADP
ap-1008	35	31	�	�	PROPN
ap-1008	35	32	and	and	CCONJ
ap-1008	35	33	into	into	ADP
ap-1008	35	34	which	which	PRON
ap-1008	35	35	all	all	DET
ap-1008	35	36	non	non	ADJ
ap-1008	35	37	-	-	ADJ
ap-1008	35	38	defined	define	VERB
ap-1008	35	39	transitions	transition	NOUN
ap-1008	35	40	of	of	ADP
ap-1008	35	41	all	all	DET
ap-1008	35	42	states	state	NOUN
ap-1008	35	43	lead	lead	VERB
ap-1008	35	44	.	.	PUNCT
ap-1008	36	1	there	there	PRON
ap-1008	36	2	are	be	VERB
ap-1008	36	3	also	also	ADV
ap-1008	36	4	nfas	nfas	ADJ
ap-1008	36	5	with	with	ADP
ap-1008	36	6	more	more	ADJ
ap-1008	36	7	than	than	ADP
ap-1008	36	8	one	one	NUM
ap-1008	36	9	initial	initial	ADJ
ap-1008	36	10	state	state	NOUN
ap-1008	36	11	.	.	PUNCT
ap-1008	37	1	such	such	ADJ
ap-1008	37	2	nfas	nfas	NOUN
ap-1008	37	3	can	can	AUX
ap-1008	37	4	be	be	AUX
ap-1008	37	5	transformed	transform	VERB
ap-1008	37	6	to	to	ADP
ap-1008	37	7	nfas	nfas	NOUN
ap-1008	37	8	with	with	ADP
ap-1008	37	9	one	one	NUM
ap-1008	37	10	initial	initial	ADJ
ap-1008	37	11	state	state	NOUN
ap-1008	37	12	introducing	introduce	VERB
ap-1008	37	13	a	a	DET
ap-1008	37	14	new	new	ADJ
ap-1008	37	15	initial	initial	ADJ
ap-1008	37	16	state	state	NOUN
ap-1008	37	17	from	from	ADP
ap-1008	37	18	which	which	PRON
ap-1008	37	19	�	�	NOUN
ap-1008	37	20	-transitions	-transition	NOUN
ap-1008	37	21	lead	lead	VERB
ap-1008	37	22	to	to	ADP
ap-1008	37	23	all	all	DET
ap-1008	37	24	former	former	ADJ
ap-1008	37	25	initial	initial	ADJ
ap-1008	37	26	states	state	NOUN
ap-1008	37	27	.	.	PUNCT
ap-1008	38	1	©	©	PROPN
ap-1008	38	2	czech	czech	PROPN
ap-1008	38	3	technical	technical	PROPN
ap-1008	38	4	university	university	PROPN
ap-1008	38	5	publishing	publishing	NOUN
ap-1008	38	6	house	house	NOUN
ap-1008	38	7	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-1008	38	8	51	51	NUM
ap-1008	38	9	acta	acta	PROPN
ap-1008	38	10	polytechnica	polytechnica	PROPN
ap-1008	38	11	vol	vol	NOUN
ap-1008	38	12	.	.	PUNCT
ap-1008	39	1	47	47	NUM
ap-1008	39	2	no	no	NOUN
ap-1008	39	3	.	.	PUNCT
ap-1008	40	1	6/2007	6/2007	NUM
ap-1008	40	2	finite	finite	ADJ
ap-1008	40	3	automata	automata	NOUN
ap-1008	40	4	implementations	implementation	NOUN
ap-1008	40	5	considering	consider	VERB
ap-1008	40	6	cpu	cpu	PROPN
ap-1008	40	7	cache	cache	PROPN
ap-1008	40	8	j.	j.	PROPN
ap-1008	40	9	holub	holub	PROPN
ap-1008	40	10	the	the	DET
ap-1008	40	11	finite	finite	ADJ
ap-1008	40	12	automata	automata	NOUN
ap-1008	40	13	are	be	AUX
ap-1008	40	14	mathematical	mathematical	ADJ
ap-1008	40	15	models	model	NOUN
ap-1008	40	16	for	for	ADP
ap-1008	40	17	finite	finite	ADJ
ap-1008	40	18	state	state	NOUN
ap-1008	40	19	systems	system	NOUN
ap-1008	40	20	.	.	PUNCT
ap-1008	41	1	more	more	ADJ
ap-1008	41	2	general	general	ADJ
ap-1008	41	3	finite	finite	ADJ
ap-1008	41	4	automaton	automaton	NOUN
ap-1008	41	5	is	be	AUX
ap-1008	41	6	the	the	DET
ap-1008	41	7	nondeterministic	nondeterministic	ADJ
ap-1008	41	8	finite	finite	ADJ
ap-1008	41	9	automaton	automaton	PROPN
ap-1008	41	10	(	(	PUNCT
ap-1008	41	11	nfa	nfa	PROPN
ap-1008	41	12	)	)	PUNCT
ap-1008	41	13	that	that	PRON
ap-1008	41	14	can	can	AUX
ap-1008	41	15	not	not	PART
ap-1008	41	16	be	be	AUX
ap-1008	41	17	directly	directly	ADV
ap-1008	41	18	used	use	VERB
ap-1008	41	19	.	.	PUNCT
ap-1008	42	1	it	it	PRON
ap-1008	42	2	is	be	AUX
ap-1008	42	3	usually	usually	ADV
ap-1008	42	4	transformed	transform	VERB
ap-1008	42	5	to	to	ADP
ap-1008	42	6	the	the	DET
ap-1008	42	7	deterministic	deterministic	ADJ
ap-1008	42	8	finite	finite	PROPN
ap-1008	42	9	automaton	automaton	PROPN
ap-1008	42	10	(	(	PUNCT
ap-1008	42	11	dfa	dfa	PROPN
ap-1008	42	12	)	)	PUNCT
ap-1008	42	13	that	that	PRON
ap-1008	42	14	then	then	ADV
ap-1008	42	15	runs	run	VERB
ap-1008	42	16	in	in	ADP
ap-1008	42	17	time	time	NOUN
ap-1008	42	18	�	�	PROPN
ap-1008	42	19	(	(	PUNCT
ap-1008	42	20	n	n	CCONJ
ap-1008	42	21	)	)	PUNCT
ap-1008	42	22	,	,	PUNCT
ap-1008	42	23	where	where	SCONJ
ap-1008	42	24	n	n	PRON
ap-1008	42	25	is	be	AUX
ap-1008	42	26	the	the	DET
ap-1008	42	27	size	size	NOUN
ap-1008	42	28	of	of	ADP
ap-1008	42	29	the	the	DET
ap-1008	42	30	input	input	NOUN
ap-1008	42	31	text	text	NOUN
ap-1008	42	32	.	.	PUNCT
ap-1008	43	1	we	we	PRON
ap-1008	43	2	present	present	VERB
ap-1008	43	3	two	two	NUM
ap-1008	43	4	main	main	ADJ
ap-1008	43	5	approaches	approach	NOUN
ap-1008	43	6	to	to	ADP
ap-1008	43	7	practical	practical	ADJ
ap-1008	43	8	implementation	implementation	NOUN
ap-1008	43	9	of	of	ADP
ap-1008	43	10	dfa	dfa	PROPN
ap-1008	43	11	considering	consider	VERB
ap-1008	43	12	cpu	cpu	PROPN
ap-1008	43	13	cache	cache	PROPN
ap-1008	43	14	.	.	PUNCT
ap-1008	44	1	the	the	DET
ap-1008	44	2	first	first	ADJ
ap-1008	44	3	approach	approach	NOUN
ap-1008	44	4	(	(	PUNCT
ap-1008	44	5	represented	represent	VERB
ap-1008	44	6	by	by	ADP
ap-1008	44	7	table	table	NOUN
ap-1008	44	8	driven	drive	VERB
ap-1008	44	9	and	and	CCONJ
ap-1008	44	10	hard	hard	ADJ
ap-1008	44	11	coded	code	VERB
ap-1008	44	12	implementations	implementation	NOUN
ap-1008	44	13	)	)	PUNCT
ap-1008	44	14	is	be	AUX
ap-1008	44	15	suitable	suitable	ADJ
ap-1008	44	16	forautomata	forautomata	NOUN
ap-1008	44	17	being	be	AUX
ap-1008	44	18	run	run	VERB
ap-1008	44	19	very	very	ADV
ap-1008	44	20	frequently	frequently	ADV
ap-1008	44	21	,	,	PUNCT
ap-1008	44	22	typically	typically	ADV
ap-1008	44	23	having	have	VERB
ap-1008	44	24	cycles	cycle	NOUN
ap-1008	44	25	.	.	PUNCT
ap-1008	45	1	the	the	DET
ap-1008	45	2	other	other	ADJ
ap-1008	45	3	approach	approach	NOUN
ap-1008	45	4	is	be	AUX
ap-1008	45	5	suitable	suitable	ADJ
ap-1008	45	6	for	for	ADP
ap-1008	45	7	a	a	DET
ap-1008	45	8	collection	collection	NOUN
ap-1008	45	9	of	of	ADP
ap-1008	45	10	automata	automata	NOUN
ap-1008	45	11	from	from	ADP
ap-1008	45	12	which	which	PRON
ap-1008	45	13	various	various	ADJ
ap-1008	45	14	automata	automata	NOUN
ap-1008	45	15	are	be	AUX
ap-1008	45	16	retrieved	retrieve	VERB
ap-1008	45	17	and	and	CCONJ
ap-1008	45	18	then	then	ADV
ap-1008	45	19	run	run	VERB
ap-1008	45	20	.	.	PUNCT
ap-1008	46	1	this	this	DET
ap-1008	46	2	second	second	ADJ
ap-1008	46	3	kind	kind	NOUN
ap-1008	46	4	of	of	ADP
ap-1008	46	5	automata	automata	NOUN
ap-1008	46	6	are	be	AUX
ap-1008	46	7	expected	expect	VERB
ap-1008	46	8	to	to	PART
ap-1008	46	9	be	be	AUX
ap-1008	46	10	cycle	cycle	NOUN
ap-1008	46	11	-	-	PUNCT
ap-1008	46	12	free	free	ADJ
ap-1008	46	13	.	.	PUNCT
ap-1008	47	1	keywords	keyword	NOUN
ap-1008	47	2	:	:	PUNCT
ap-1008	47	3	deterministic	deterministic	ADJ
ap-1008	47	4	finite	finite	PROPN
ap-1008	47	5	automaton	automaton	PROPN
ap-1008	47	6	,	,	PUNCT
ap-1008	47	7	cpu	cpu	NOUN
ap-1008	47	8	cache	cache	NOUN
ap-1008	47	9	,	,	PUNCT
ap-1008	47	10	implementation	implementation	NOUN
ap-1008	47	11	.	.	PUNCT
ap-1008	48	1	l2	l2	NOUN
ap-1008	48	2	cachecpu	cachecpu	ADP
ap-1008	48	3	core	core	PROPN
ap-1008	48	4	raml1	raml1	PROPN
ap-1008	48	5	cache	cache	PROPN
ap-1008	48	6	fig	fig	PROPN
ap-1008	48	7	.	.	PUNCT
ap-1008	49	1	1	1	NUM
ap-1008	49	2	:	:	PUNCT
ap-1008	49	3	memory	memory	NOUN
ap-1008	49	4	cache	cache	NOUN
ap-1008	49	5	hierarchy	hierarchy	VERB
ap-1008	49	6	2	2	NUM
ap-1008	49	7	b	b	NOUN
ap-1008	49	8	0	0	NUM
ap-1008	49	9	3	3	NUM
ap-1008	49	10	c	c	NOUN
ap-1008	49	11	4	4	NUM
ap-1008	49	12	d	d	SYM
ap-1008	49	13	1	1	NUM
ap-1008	49	14	a	a	DET
ap-1008	49	15	d	d	X
ap-1008	49	16	dc	dc	PROPN
ap-1008	49	17	fig	fig	NOUN
ap-1008	49	18	.	.	PUNCT
ap-1008	50	1	2	2	NUM
ap-1008	50	2	:	:	PUNCT
ap-1008	50	3	a	a	DET
ap-1008	50	4	deterministic	deterministic	ADJ
ap-1008	50	5	finite	finite	NOUN
ap-1008	50	6	automaton	automaton	PROPN
ap-1008	50	7	nfa	nfa	PROPN
ap-1008	50	8	accepts	accept	VERB
ap-1008	50	9	a	a	DET
ap-1008	50	10	given	give	VERB
ap-1008	50	11	input	input	NOUN
ap-1008	50	12	string	string	NOUN
ap-1008	50	13	w	w	PROPN
ap-1008	50	14	�	�	PROPN
ap-1008	50	15	�	�	PROPN
ap-1008	50	16	*	*	PUNCT
ap-1008	50	17	if	if	SCONJ
ap-1008	50	18	there	there	PRON
ap-1008	50	19	exists	exist	VERB
ap-1008	50	20	a	a	DET
ap-1008	50	21	path	path	NOUN
ap-1008	50	22	(	(	PUNCT
ap-1008	50	23	a	a	DET
ap-1008	50	24	sequence	sequence	NOUN
ap-1008	50	25	of	of	ADP
ap-1008	50	26	transitions	transition	NOUN
ap-1008	50	27	)	)	PUNCT
ap-1008	50	28	from	from	ADP
ap-1008	50	29	the	the	DET
ap-1008	50	30	initial	initial	ADJ
ap-1008	50	31	state	state	NOUN
ap-1008	50	32	to	to	ADP
ap-1008	50	33	a	a	DET
ap-1008	50	34	final	final	ADJ
ap-1008	50	35	state	state	NOUN
ap-1008	50	36	spelling	spelling	NOUN
ap-1008	50	37	w.	w.	PROPN
ap-1008	50	38	the	the	DET
ap-1008	50	39	problem	problem	NOUN
ap-1008	50	40	occurs	occur	VERB
ap-1008	50	41	when	when	SCONJ
ap-1008	50	42	for	for	ADP
ap-1008	50	43	a	a	DET
ap-1008	50	44	pair	pair	NOUN
ap-1008	50	45	(	(	PUNCT
ap-1008	50	46	q	q	NOUN
ap-1008	50	47	,	,	PUNCT
ap-1008	50	48	a	a	NOUN
ap-1008	50	49	)	)	PUNCT
ap-1008	50	50	,	,	PUNCT
ap-1008	50	51	q	q	PRON
ap-1008	50	52	q	q	PROPN
ap-1008	50	53	�	�	PROPN
ap-1008	50	54	,	,	PUNCT
ap-1008	50	55	a	a	DET
ap-1008	50	56	�	�	PROPN
ap-1008	50	57	�	�	PROPN
ap-1008	50	58	(	(	PUNCT
ap-1008	50	59	i.e.	i.e.	X
ap-1008	50	60	,	,	PUNCT
ap-1008	50	61	state	state	NOUN
ap-1008	50	62	q	q	NOUN
ap-1008	50	63	of	of	ADP
ap-1008	50	64	nfa	nfa	PROPN
ap-1008	50	65	is	be	AUX
ap-1008	50	66	active	active	ADJ
ap-1008	50	67	and	and	CCONJ
ap-1008	50	68	a	a	PRON
ap-1008	50	69	in	in	ADP
ap-1008	50	70	the	the	DET
ap-1008	50	71	current	current	ADJ
ap-1008	50	72	input	input	NOUN
ap-1008	50	73	symbol	symbol	NOUN
ap-1008	50	74	)	)	PUNCT
ap-1008	50	75	there	there	PRON
ap-1008	50	76	are	be	VERB
ap-1008	50	77	more	more	ADJ
ap-1008	50	78	possibilities	possibility	NOUN
ap-1008	50	79	how	how	SCONJ
ap-1008	50	80	to	to	PART
ap-1008	50	81	continue	continue	VERB
ap-1008	50	82	:	:	PUNCT
ap-1008	50	83	1	1	X
ap-1008	50	84	.	.	X
ap-1008	50	85	there	there	PRON
ap-1008	50	86	are	be	VERB
ap-1008	50	87	more	more	ADJ
ap-1008	50	88	than	than	ADP
ap-1008	50	89	one	one	NUM
ap-1008	50	90	transitions	transition	NOUN
ap-1008	50	91	labeled	label	VERB
ap-1008	50	92	by	by	ADP
ap-1008	50	93	a	a	DET
ap-1008	50	94	outgoing	outgoing	NOUN
ap-1008	50	95	from	from	ADP
ap-1008	50	96	state	state	NOUN
ap-1008	50	97	q.	q.	NOUN
ap-1008	50	98	that	that	PRON
ap-1008	50	99	is	be	AUX
ap-1008	50	100	�	�	PROPN
ap-1008	50	101	(	(	PUNCT
ap-1008	50	102	,	,	PUNCT
ap-1008	50	103	)	)	PUNCT
ap-1008	50	104	q	q	PROPN
ap-1008	50	105	a	a	DET
ap-1008	50	106	�	�	PROPN
ap-1008	50	107	1	1	NUM
ap-1008	50	108	.	.	NOUN
ap-1008	50	109	2	2	NUM
ap-1008	50	110	.	.	X
ap-1008	51	1	there	there	PRON
ap-1008	51	2	is	be	VERB
ap-1008	51	3	an	an	DET
ap-1008	51	4	�	�	NOUN
ap-1008	51	5	-transition	-transition	NOUN
ap-1008	51	6	in	in	ADP
ap-1008	51	7	addition	addition	NOUN
ap-1008	51	8	to	to	ADP
ap-1008	51	9	other	other	ADJ
ap-1008	51	10	transitions	transition	NOUN
ap-1008	51	11	outgoing	outgoing	ADJ
ap-1008	51	12	from	from	ADP
ap-1008	51	13	the	the	DET
ap-1008	51	14	same	same	ADJ
ap-1008	51	15	state	state	NOUN
ap-1008	51	16	.	.	PUNCT
ap-1008	52	1	in	in	ADP
ap-1008	52	2	such	such	DET
ap-1008	52	3	a	a	DET
ap-1008	52	4	case	case	NOUN
ap-1008	52	5	nfa	nfa	PROPN
ap-1008	52	6	can	can	AUX
ap-1008	52	7	not	not	PART
ap-1008	52	8	decide	decide	VERB
ap-1008	52	9	,	,	PUNCT
ap-1008	52	10	having	have	VERB
ap-1008	52	11	only	only	ADV
ap-1008	52	12	the	the	DET
ap-1008	52	13	knowledge	knowledge	NOUN
ap-1008	52	14	of	of	ADP
ap-1008	52	15	the	the	DET
ap-1008	52	16	current	current	ADJ
ap-1008	52	17	state	state	NOUN
ap-1008	52	18	and	and	CCONJ
ap-1008	52	19	current	current	ADJ
ap-1008	52	20	input	input	NOUN
ap-1008	52	21	symbol	symbol	NOUN
ap-1008	52	22	,	,	PUNCT
ap-1008	52	23	which	which	PRON
ap-1008	52	24	transition	transition	NOUN
ap-1008	52	25	to	to	PART
ap-1008	52	26	take	take	VERB
ap-1008	52	27	.	.	PUNCT
ap-1008	53	1	due	due	ADP
ap-1008	53	2	to	to	ADP
ap-1008	53	3	this	this	DET
ap-1008	53	4	nondeterminism	nondeterminism	NOUN
ap-1008	53	5	nfa	nfa	PROPN
ap-1008	53	6	can	can	AUX
ap-1008	53	7	not	not	PART
ap-1008	53	8	be	be	AUX
ap-1008	53	9	directly	directly	ADV
ap-1008	53	10	used	use	VERB
ap-1008	53	11	.	.	PUNCT
ap-1008	54	1	there	there	PRON
ap-1008	54	2	are	be	VERB
ap-1008	54	3	two	two	NUM
ap-1008	54	4	options	option	NOUN
ap-1008	54	5	:	:	PUNCT
ap-1008	54	6	1	1	X
ap-1008	54	7	.	.	X
ap-1008	55	1	we	we	PRON
ap-1008	55	2	can	can	AUX
ap-1008	55	3	transform	transform	VERB
ap-1008	55	4	nfa	nfa	PROPN
ap-1008	55	5	to	to	ADP
ap-1008	55	6	the	the	DET
ap-1008	55	7	equivalent	equivalent	ADJ
ap-1008	55	8	dfa	dfa	NOUN
ap-1008	55	9	using	use	VERB
ap-1008	55	10	the	the	DET
ap-1008	55	11	standard	standard	NOUN
ap-1008	55	12	subset	subset	NOUN
ap-1008	55	13	construction	construction	NOUN
ap-1008	55	14	[	[	X
ap-1008	55	15	21	21	NUM
ap-1008	55	16	]	]	PUNCT
ap-1008	55	17	.	.	PUNCT
ap-1008	56	1	however	however	ADV
ap-1008	56	2	,	,	PUNCT
ap-1008	56	3	it	it	PRON
ap-1008	56	4	may	may	AUX
ap-1008	56	5	lead	lead	VERB
ap-1008	56	6	to	to	ADP
ap-1008	56	7	an	an	DET
ap-1008	56	8	exponential	exponential	ADJ
ap-1008	56	9	increase	increase	NOUN
ap-1008	56	10	of	of	ADP
ap-1008	56	11	number	number	NOUN
ap-1008	56	12	of	of	ADP
ap-1008	56	13	states	state	NOUN
ap-1008	56	14	(	(	PUNCT
ap-1008	56	15	2q	2q	NUM
ap-1008	56	16	nfa	nfa	PROPN
ap-1008	56	17	states	state	NOUN
ap-1008	56	18	,	,	PUNCT
ap-1008	56	19	where	where	SCONJ
ap-1008	56	20	qnfa	qnfa	NOUN
ap-1008	56	21	is	be	AUX
ap-1008	56	22	the	the	DET
ap-1008	56	23	number	number	NOUN
ap-1008	56	24	of	of	ADP
ap-1008	56	25	states	state	NOUN
ap-1008	56	26	of	of	ADP
ap-1008	56	27	the	the	DET
ap-1008	56	28	original	original	ADJ
ap-1008	56	29	nfa	nfa	PROPN
ap-1008	56	30	)	)	PUNCT
ap-1008	56	31	.	.	PUNCT
ap-1008	57	1	the	the	DET
ap-1008	57	2	resulting	result	VERB
ap-1008	57	3	dfa	dfa	PROPN
ap-1008	57	4	then	then	ADV
ap-1008	57	5	runs	run	VERB
ap-1008	57	6	in	in	ADP
ap-1008	57	7	linear	linear	ADJ
ap-1008	57	8	time	time	NOUN
ap-1008	57	9	with	with	ADP
ap-1008	57	10	respect	respect	NOUN
ap-1008	57	11	to	to	ADP
ap-1008	57	12	the	the	DET
ap-1008	57	13	size	size	NOUN
ap-1008	57	14	of	of	ADP
ap-1008	57	15	the	the	DET
ap-1008	57	16	input	input	NOUN
ap-1008	57	17	text	text	NOUN
ap-1008	57	18	.	.	PUNCT
ap-1008	58	1	2	2	X
ap-1008	58	2	.	.	X
ap-1008	58	3	we	we	PRON
ap-1008	58	4	can	can	AUX
ap-1008	58	5	simulate	simulate	VERB
ap-1008	58	6	the	the	DET
ap-1008	58	7	run	run	NOUN
ap-1008	58	8	of	of	ADP
ap-1008	58	9	nfa	nfa	PROPN
ap-1008	58	10	in	in	ADP
ap-1008	58	11	a	a	DET
ap-1008	58	12	deterministic	deterministic	ADJ
ap-1008	58	13	way	way	NOUN
ap-1008	58	14	.	.	PUNCT
ap-1008	59	1	we	we	PRON
ap-1008	59	2	can	can	AUX
ap-1008	59	3	use	use	VERB
ap-1008	59	4	basic	basic	ADJ
ap-1008	59	5	simulation	simulation	NOUN
ap-1008	59	6	method	method	NOUN
ap-1008	59	7	[	[	X
ap-1008	59	8	7	7	NUM
ap-1008	59	9	,	,	PUNCT
ap-1008	59	10	6	6	NUM
ap-1008	59	11	]	]	PUNCT
ap-1008	59	12	usable	usable	ADJ
ap-1008	59	13	for	for	ADP
ap-1008	59	14	any	any	DET
ap-1008	59	15	nfa	nfa	PROPN
ap-1008	59	16	.	.	PUNCT
ap-1008	60	1	for	for	ADP
ap-1008	60	2	nfa	nfa	PROPN
ap-1008	60	3	with	with	ADP
ap-1008	60	4	a	a	DET
ap-1008	60	5	regular	regular	ADJ
ap-1008	60	6	structure	structure	NOUN
ap-1008	60	7	(	(	PUNCT
ap-1008	60	8	like	like	ADP
ap-1008	60	9	in	in	ADP
ap-1008	60	10	the	the	DET
ap-1008	60	11	exact	exact	ADJ
ap-1008	60	12	and	and	CCONJ
ap-1008	60	13	approximate	approximate	ADJ
ap-1008	60	14	pattern	pattern	NOUN
ap-1008	60	15	matching	match	VERB
ap-1008	60	16	field	field	NOUN
ap-1008	60	17	)	)	PUNCT
ap-1008	60	18	we	we	PRON
ap-1008	60	19	can	can	AUX
ap-1008	60	20	use	use	VERB
ap-1008	60	21	bit	bit	NOUN
ap-1008	60	22	parallelism	parallelism	NOUN
ap-1008	61	1	[	[	X
ap-1008	61	2	16,7,6,10	16,7,6,10	NUM
ap-1008	61	3	]	]	PUNCT
ap-1008	61	4	or	or	CCONJ
ap-1008	61	5	dynamic	dynamic	ADJ
ap-1008	61	6	programming	programming	NOUN
ap-1008	62	1	[	[	X
ap-1008	62	2	16	16	NUM
ap-1008	62	3	,	,	PUNCT
ap-1008	62	4	8	8	NUM
ap-1008	62	5	,	,	PUNCT
ap-1008	62	6	6	6	NUM
ap-1008	62	7	]	]	PUNCT
ap-1008	62	8	simulation	simulation	NOUN
ap-1008	62	9	methods	method	NOUN
ap-1008	62	10	which	which	PRON
ap-1008	62	11	improve	improve	VERB
ap-1008	62	12	the	the	DET
ap-1008	62	13	running	running	ADJ
ap-1008	62	14	time	time	NOUN
ap-1008	62	15	of	of	ADP
ap-1008	62	16	the	the	DET
ap-1008	62	17	basic	basic	ADJ
ap-1008	62	18	simulation	simulation	NOUN
ap-1008	62	19	method	method	NOUN
ap-1008	62	20	in	in	ADP
ap-1008	62	21	this	this	DET
ap-1008	62	22	special	special	ADJ
ap-1008	62	23	case	case	NOUN
ap-1008	62	24	.	.	PUNCT
ap-1008	63	1	the	the	DET
ap-1008	63	2	simulation	simulation	NOUN
ap-1008	63	3	runs	run	VERB
ap-1008	63	4	slower	slow	ADJ
ap-1008	63	5	than	than	ADP
ap-1008	63	6	dfa	dfa	PROPN
ap-1008	63	7	however	however	ADV
ap-1008	63	8	the	the	DET
ap-1008	63	9	memory	memory	NOUN
ap-1008	63	10	requirements	requirement	NOUN
ap-1008	63	11	are	be	AUX
ap-1008	63	12	much	much	ADV
ap-1008	63	13	smaller	small	ADJ
ap-1008	63	14	.	.	PUNCT
ap-1008	64	1	practical	practical	ADJ
ap-1008	64	2	experiments	experiment	NOUN
ap-1008	64	3	were	be	AUX
ap-1008	64	4	given	give	VERB
ap-1008	64	5	in	in	ADP
ap-1008	64	6	[	[	PUNCT
ap-1008	64	7	11	11	NUM
ap-1008	64	8	]	]	PUNCT
ap-1008	64	9	.	.	PUNCT
ap-1008	65	1	3	3	NUM
ap-1008	65	2	deterministic	deterministic	ADJ
ap-1008	65	3	finite	finite	NOUN
ap-1008	65	4	automaton	automaton	NOUN
ap-1008	65	5	implementation	implementation	NOUN
ap-1008	65	6	further	far	ADV
ap-1008	65	7	in	in	ADP
ap-1008	65	8	the	the	DET
ap-1008	65	9	text	text	NOUN
ap-1008	65	10	we	we	PRON
ap-1008	65	11	do	do	AUX
ap-1008	65	12	not	not	PART
ap-1008	65	13	consider	consider	VERB
ap-1008	65	14	simulation	simulation	NOUN
ap-1008	65	15	techniques	technique	NOUN
ap-1008	65	16	.	.	PUNCT
ap-1008	66	1	we	we	PRON
ap-1008	66	2	consider	consider	VERB
ap-1008	66	3	only	only	ADV
ap-1008	66	4	dfa	dfa	PROPN
ap-1008	66	5	.	.	PROPN
ap-1008	66	6	dfa	dfa	PROPN
ap-1008	66	7	runs	run	VERB
ap-1008	66	8	theoretically	theoretically	ADV
ap-1008	66	9	in	in	ADP
ap-1008	66	10	time	time	NOUN
ap-1008	66	11	�	�	PROPN
ap-1008	66	12	(	(	PUNCT
ap-1008	66	13	)	)	PUNCT
ap-1008	66	14	n	n	NOUN
ap-1008	66	15	,	,	PUNCT
ap-1008	66	16	where	where	SCONJ
ap-1008	66	17	n	n	PRON
ap-1008	66	18	is	be	AUX
ap-1008	66	19	the	the	DET
ap-1008	66	20	size	size	NOUN
ap-1008	66	21	of	of	ADP
ap-1008	66	22	the	the	DET
ap-1008	66	23	input	input	NOUN
ap-1008	66	24	text	text	NOUN
ap-1008	66	25	.	.	PUNCT
ap-1008	67	1	there	there	PRON
ap-1008	67	2	are	be	VERB
ap-1008	67	3	two	two	NUM
ap-1008	67	4	main	main	ADJ
ap-1008	67	5	techniques	technique	NOUN
ap-1008	67	6	for	for	ADP
ap-1008	67	7	implementation	implementation	NOUN
ap-1008	67	8	of	of	ADP
ap-1008	67	9	dfa	dfa	NOUN
ap-1008	67	10	:	:	PUNCT
ap-1008	67	11	1	1	NUM
ap-1008	67	12	.	.	NOUN
ap-1008	67	13	table	table	NOUN
ap-1008	67	14	driven	drive	VERB
ap-1008	67	15	(	(	PUNCT
ap-1008	67	16	td	td	NOUN
ap-1008	67	17	):	):	PUNCT
ap-1008	67	18	the	the	DET
ap-1008	67	19	mapping	mapping	NOUN
ap-1008	67	20	�	�	PROPN
ap-1008	67	21	is	be	AUX
ap-1008	67	22	implemented	implement	VERB
ap-1008	67	23	as	as	ADP
ap-1008	67	24	a	a	DET
ap-1008	67	25	transition	transition	NOUN
ap-1008	67	26	matrix	matrix	NOUN
ap-1008	67	27	of	of	ADP
ap-1008	67	28	size	size	NOUN
ap-1008	67	29	q	q	PROPN
ap-1008	67	30	�	�	PROPN
ap-1008	67	31	�	�	PROPN
ap-1008	67	32	(	(	PUNCT
ap-1008	67	33	transition	transition	NOUN
ap-1008	67	34	table	table	NOUN
ap-1008	67	35	)	)	PUNCT
ap-1008	67	36	.	.	PUNCT
ap-1008	68	1	the	the	DET
ap-1008	68	2	current	current	ADJ
ap-1008	68	3	state	state	NOUN
ap-1008	68	4	number	number	NOUN
ap-1008	68	5	is	be	AUX
ap-1008	68	6	held	hold	VERB
ap-1008	68	7	in	in	ADP
ap-1008	68	8	a	a	DET
ap-1008	68	9	variable	variable	ADJ
ap-1008	68	10	qcurr	qcurr	NOUN
ap-1008	68	11	and	and	CCONJ
ap-1008	68	12	the	the	DET
ap-1008	68	13	next	next	ADJ
ap-1008	68	14	state	state	NOUN
ap-1008	68	15	number	number	NOUN
ap-1008	68	16	is	be	AUX
ap-1008	68	17	retrieved	retrieve	VERB
ap-1008	68	18	from	from	ADP
ap-1008	68	19	the	the	DET
ap-1008	68	20	transitiontable	transitiontable	NOUN
ap-1008	68	21	from	from	ADP
ap-1008	68	22	line	line	NOUN
ap-1008	68	23	qcurr	qcurr	NOUN
ap-1008	68	24	and	and	CCONJ
ap-1008	68	25	column	column	NOUN
ap-1008	68	26	a	a	X
ap-1008	68	27	,	,	PUNCT
ap-1008	68	28	where	where	SCONJ
ap-1008	68	29	a	a	PRON
ap-1008	68	30	is	be	AUX
ap-1008	68	31	the	the	DET
ap-1008	68	32	current	current	ADJ
ap-1008	68	33	input	input	NOUN
ap-1008	68	34	symbol	symbol	NOUN
ap-1008	68	35	.	.	PUNCT
ap-1008	69	1	2	2	X
ap-1008	69	2	.	.	X
ap-1008	69	3	hard	hard	ADV
ap-1008	69	4	coded	code	VERB
ap-1008	69	5	(	(	PUNCT
ap-1008	69	6	hc	hc	NOUN
ap-1008	69	7	)	)	PUNCT
ap-1008	70	1	[	[	X
ap-1008	70	2	22	22	NUM
ap-1008	70	3	]	]	PUNCT
ap-1008	70	4	:	:	PUNCT
ap-1008	70	5	the	the	DET
ap-1008	70	6	transition	transition	NOUN
ap-1008	70	7	table	table	NOUN
ap-1008	70	8	�	�	PROPN
ap-1008	70	9	is	be	AUX
ap-1008	70	10	represented	represent	VERB
ap-1008	70	11	as	as	ADP
ap-1008	70	12	a	a	DET
ap-1008	70	13	programming	programming	NOUN
ap-1008	70	14	language	language	NOUN
ap-1008	70	15	code	code	NOUN
ap-1008	70	16	.	.	PUNCT
ap-1008	71	1	for	for	ADP
ap-1008	71	2	each	each	DET
ap-1008	71	3	state	state	NOUN
ap-1008	71	4	there	there	PRON
ap-1008	71	5	is	be	VERB
ap-1008	71	6	a	a	DET
ap-1008	71	7	place	place	NOUN
ap-1008	71	8	starting	start	VERB
ap-1008	71	9	with	with	ADP
ap-1008	71	10	a	a	DET
ap-1008	71	11	state	state	NOUN
ap-1008	71	12	-	-	PUNCT
ap-1008	71	13	label	label	NOUN
ap-1008	71	14	.	.	PUNCT
ap-1008	72	1	then	then	ADV
ap-1008	72	2	there	there	PRON
ap-1008	72	3	is	be	VERB
ap-1008	72	4	a	a	DET
ap-1008	72	5	sequence	sequence	NOUN
ap-1008	72	6	of	of	ADP
ap-1008	72	7	conditional	conditional	ADJ
ap-1008	72	8	jumps	jump	NOUN
ap-1008	72	9	,	,	PUNCT
ap-1008	72	10	where	where	SCONJ
ap-1008	72	11	based	base	VERB
ap-1008	72	12	on	on	ADP
ap-1008	72	13	the	the	DET
ap-1008	72	14	current	current	ADJ
ap-1008	72	15	input	input	NOUN
ap-1008	72	16	symbol	symbol	NOUN
ap-1008	72	17	the	the	DET
ap-1008	72	18	corresponding	corresponding	ADJ
ap-1008	72	19	goto	goto	ADJ
ap-1008	72	20	command	command	NOUN
ap-1008	72	21	to	to	ADP
ap-1008	72	22	the	the	DET
ap-1008	72	23	destination	destination	NOUN
ap-1008	72	24	state	state	NOUN
ap-1008	72	25	-	-	PUNCT
ap-1008	72	26	label	label	NOUN
ap-1008	72	27	is	be	AUX
ap-1008	72	28	performed	perform	VERB
ap-1008	72	29	.	.	PUNCT
ap-1008	73	1	3.1	3.1	NUM
ap-1008	73	2	table	table	NOUN
ap-1008	73	3	driven	drive	VERB
ap-1008	73	4	an	an	DET
ap-1008	73	5	example	example	NOUN
ap-1008	73	6	of	of	ADP
ap-1008	73	7	td	td	NOUN
ap-1008	73	8	implementation	implementation	NOUN
ap-1008	73	9	is	be	AUX
ap-1008	73	10	shown	show	VERB
ap-1008	73	11	in	in	ADP
ap-1008	73	12	fig	fig	NOUN
ap-1008	73	13	.	.	PUNCT
ap-1008	74	1	3	3	X
ap-1008	74	2	.	.	X
ap-1008	74	3	for	for	ADP
ap-1008	74	4	partially	partially	ADV
ap-1008	74	5	defined	define	VERB
ap-1008	74	6	dfa	dfa	NOUN
ap-1008	74	7	one	one	PRON
ap-1008	74	8	have	have	VERB
ap-1008	74	9	to	to	PART
ap-1008	74	10	either	either	CCONJ
ap-1008	74	11	transform	transform	VERB
ap-1008	74	12	it	it	PRON
ap-1008	74	13	to	to	ADP
ap-1008	74	14	a	a	DET
ap-1008	74	15	completely	completely	ADV
ap-1008	74	16	defined	define	VERB
ap-1008	74	17	dfa	dfa	NOUN
ap-1008	74	18	or	or	CCONJ
ap-1008	74	19	handle	handle	VERB
ap-1008	74	20	the	the	DET
ap-1008	74	21	case	case	NOUN
ap-1008	74	22	when	when	SCONJ
ap-1008	74	23	a	a	DET
ap-1008	74	24	undefined	undefined	ADJ
ap-1008	74	25	transition	transition	NOUN
ap-1008	74	26	should	should	AUX
ap-1008	74	27	be	be	AUX
ap-1008	74	28	used	use	VERB
ap-1008	74	29	.	.	PUNCT
ap-1008	75	1	obviously	obviously	ADV
ap-1008	75	2	td	td	VERB
ap-1008	75	3	implementation	implementation	NOUN
ap-1008	75	4	is	be	AUX
ap-1008	75	5	very	very	ADV
ap-1008	75	6	efficient	efficient	ADJ
ap-1008	75	7	for	for	ADP
ap-1008	75	8	completely	completely	ADV
ap-1008	75	9	defined	define	VERB
ap-1008	75	10	dfa	dfa	NOUN
ap-1008	75	11	or	or	CCONJ
ap-1008	75	12	dfas	dfas	PROPN
ap-1008	75	13	with	with	ADP
ap-1008	75	14	non	non	ADJ
ap-1008	75	15	-	-	ADJ
ap-1008	75	16	sparse	sparse	ADJ
ap-1008	75	17	transition	transition	NOUN
ap-1008	75	18	table	table	NOUN
ap-1008	75	19	.	.	PUNCT
ap-1008	76	1	it	it	PRON
ap-1008	76	2	can	can	AUX
ap-1008	76	3	be	be	AUX
ap-1008	76	4	also	also	ADV
ap-1008	76	5	very	very	ADV
ap-1008	76	6	efficiently	efficiently	ADV
ap-1008	76	7	used	use	VERB
ap-1008	76	8	in	in	ADP
ap-1008	76	9	programs	program	NOUN
ap-1008	76	10	,	,	PUNCT
ap-1008	76	11	where	where	SCONJ
ap-1008	76	12	dfa	dfa	PROPN
ap-1008	76	13	is	be	AUX
ap-1008	76	14	constructed	construct	VERB
ap-1008	76	15	from	from	ADP
ap-1008	76	16	a	a	DET
ap-1008	76	17	given	give	VERB
ap-1008	76	18	input	input	NOUN
ap-1008	77	1	and	and	CCONJ
ap-1008	77	2	then	then	ADV
ap-1008	77	3	it	it	PRON
ap-1008	77	4	is	be	AUX
ap-1008	77	5	run	run	VERB
ap-1008	77	6	.	.	PUNCT
ap-1008	78	1	in	in	ADP
ap-1008	78	2	such	such	DET
ap-1008	78	3	a	a	DET
ap-1008	78	4	case	case	NOUN
ap-1008	78	5	it	it	PRON
ap-1008	78	6	can	can	AUX
ap-1008	78	7	be	be	AUX
ap-1008	78	8	easily	easily	ADV
ap-1008	78	9	stored	store	VERB
ap-1008	78	10	into	into	ADP
ap-1008	78	11	the	the	DET
ap-1008	78	12	transition	transition	NOUN
ap-1008	78	13	matrix	matrix	NOUN
ap-1008	78	14	.	.	PUNCT
ap-1008	79	1	the	the	DET
ap-1008	79	2	code	code	NOUN
ap-1008	79	3	for	for	ADP
ap-1008	79	4	the	the	DET
ap-1008	79	5	dfa	dfa	PROPN
ap-1008	79	6	run	run	NOUN
ap-1008	79	7	is	be	AUX
ap-1008	79	8	then	then	ADV
ap-1008	79	9	independent	independent	ADJ
ap-1008	79	10	on	on	ADP
ap-1008	79	11	the	the	DET
ap-1008	79	12	content	content	NOUN
ap-1008	79	13	of	of	ADP
ap-1008	79	14	the	the	DET
ap-1008	79	15	transition	transition	NOUN
ap-1008	79	16	matrix	matrix	NOUN
ap-1008	79	17	.	.	PUNCT
ap-1008	80	1	td	td	NOUN
ap-1008	80	2	implementation	implementation	NOUN
ap-1008	80	3	is	be	AUX
ap-1008	80	4	also	also	ADV
ap-1008	80	5	very	very	ADV
ap-1008	80	6	convenient	convenient	ADJ
ap-1008	80	7	for	for	ADP
ap-1008	80	8	a	a	DET
ap-1008	80	9	hardware	hardware	NOUN
ap-1008	80	10	implementation	implementation	NOUN
ap-1008	80	11	,	,	PUNCT
ap-1008	80	12	where	where	SCONJ
ap-1008	80	13	the	the	DET
ap-1008	80	14	transition	transition	NOUN
ap-1008	80	15	matrix	matrix	NOUN
ap-1008	80	16	is	be	AUX
ap-1008	80	17	represented	represent	VERB
ap-1008	80	18	by	by	ADP
ap-1008	80	19	a	a	DET
ap-1008	80	20	memory	memory	NOUN
ap-1008	80	21	chip	chip	NOUN
ap-1008	80	22	.	.	PUNCT
ap-1008	81	1	3.2	3.2	NUM
ap-1008	81	2	hard	hard	ADV
ap-1008	81	3	coded	code	VERB
ap-1008	81	4	an	an	DET
ap-1008	81	5	example	example	NOUN
ap-1008	81	6	of	of	ADP
ap-1008	81	7	hc	hc	NOUN
ap-1008	81	8	implementation	implementation	NOUN
ap-1008	81	9	is	be	AUX
ap-1008	81	10	shown	show	VERB
ap-1008	81	11	in	in	ADP
ap-1008	81	12	fig	fig	NOUN
ap-1008	81	13	.	.	PUNCT
ap-1008	82	1	4	4	X
ap-1008	82	2	.	.	X
ap-1008	82	3	the	the	DET
ap-1008	82	4	implementation	implementation	NOUN
ap-1008	82	5	can	can	AUX
ap-1008	82	6	work	work	VERB
ap-1008	82	7	with	with	ADP
ap-1008	82	8	partially	partially	ADV
ap-1008	82	9	defined	define	VERB
ap-1008	82	10	dfa	dfa	NOUN
ap-1008	82	11	in	in	ADP
ap-1008	82	12	this	this	DET
ap-1008	82	13	case	case	NOUN
ap-1008	82	14	.	.	PUNCT
ap-1008	83	1	hc	hc	PRON
ap-1008	83	2	implementation	implementation	NOUN
ap-1008	83	3	may	may	AUX
ap-1008	83	4	save	save	VERB
ap-1008	83	5	some	some	DET
ap-1008	83	6	space	space	NOUN
ap-1008	83	7	when	when	SCONJ
ap-1008	83	8	used	use	VERB
ap-1008	83	9	for	for	ADP
ap-1008	83	10	partially	partially	ADV
ap-1008	83	11	defined	define	VERB
ap-1008	83	12	dfa	dfa	NOUN
ap-1008	83	13	,	,	PUNCT
ap-1008	83	14	where	where	SCONJ
ap-1008	83	15	the	the	DET
ap-1008	83	16	transition	transition	NOUN
ap-1008	83	17	matrix	matrix	NOUN
ap-1008	83	18	would	would	AUX
ap-1008	83	19	be	be	AUX
ap-1008	83	20	sparse	sparse	ADJ
ap-1008	83	21	.	.	PUNCT
ap-1008	84	1	it	it	PRON
ap-1008	84	2	can	can	AUX
ap-1008	84	3	not	not	PART
ap-1008	84	4	be	be	AUX
ap-1008	84	5	used	use	VERB
ap-1008	84	6	in	in	ADP
ap-1008	84	7	programs	program	NOUN
ap-1008	84	8	,	,	PUNCT
ap-1008	84	9	where	where	SCONJ
ap-1008	84	10	dfa	dfa	PROPN
ap-1008	84	11	is	be	AUX
ap-1008	84	12	constructed	construct	VERB
ap-1008	84	13	from	from	ADP
ap-1008	84	14	the	the	DET
ap-1008	84	15	input	input	NOUN
ap-1008	84	16	.	.	PUNCT
ap-1008	85	1	when	when	SCONJ
ap-1008	85	2	dfa	dfa	PROPN
ap-1008	85	3	is	be	AUX
ap-1008	85	4	constructed	construct	VERB
ap-1008	85	5	,	,	PUNCT
ap-1008	85	6	a	a	DET
ap-1008	85	7	hard	hard	ADV
ap-1008	85	8	coded	code	VERB
ap-1008	85	9	part	part	NOUN
ap-1008	85	10	of	of	ADP
ap-1008	85	11	the	the	DET
ap-1008	85	12	program	program	NOUN
ap-1008	85	13	has	have	VERB
ap-1008	85	14	to	to	PART
ap-1008	85	15	be	be	AUX
ap-1008	85	16	generated	generate	VERB
ap-1008	85	17	in	in	ADP
ap-1008	85	18	a	a	DET
ap-1008	85	19	programming	programming	NOUN
ap-1008	85	20	language	language	NOUN
ap-1008	85	21	,	,	PUNCT
ap-1008	85	22	then	then	ADV
ap-1008	85	23	compiled	compile	VERB
ap-1008	85	24	and	and	CCONJ
ap-1008	85	25	executed	execute	VERB
ap-1008	85	26	.	.	PUNCT
ap-1008	86	1	this	this	DET
ap-1008	86	2	technique	technique	NOUN
ap-1008	86	3	would	would	AUX
ap-1008	86	4	need	need	VERB
ap-1008	86	5	calls	call	NOUN
ap-1008	86	6	of	of	ADP
ap-1008	86	7	several	several	ADJ
ap-1008	86	8	programs	program	NOUN
ap-1008	86	9	(	(	PUNCT
ap-1008	86	10	compiler	compiler	NOUN
ap-1008	86	11	,	,	PUNCT
ap-1008	86	12	linker	linker	NOUN
ap-1008	86	13	,	,	PUNCT
ap-1008	86	14	the	the	DET
ap-1008	86	15	dfa	dfa	PROPN
ap-1008	86	16	program	program	NOUN
ap-1008	86	17	itself	itself	PRON
ap-1008	86	18	)	)	PUNCT
ap-1008	86	19	and	and	CCONJ
ap-1008	86	20	would	would	AUX
ap-1008	86	21	be	be	AUX
ap-1008	86	22	very	very	ADV
ap-1008	86	23	inefficient	inefficient	ADJ
ap-1008	86	24	.	.	PUNCT
ap-1008	87	1	note	note	VERB
ap-1008	87	2	that	that	SCONJ
ap-1008	87	3	we	we	PRON
ap-1008	87	4	can	can	AUX
ap-1008	87	5	not	not	PART
ap-1008	87	6	use	use	VERB
ap-1008	87	7	the	the	DET
ap-1008	87	8	recursive	recursive	ADJ
ap-1008	87	9	descent	descent	NOUN
ap-1008	88	1	[	[	X
ap-1008	88	2	1	1	NUM
ap-1008	88	3	]	]	PUNCT
ap-1008	88	4	approach	approach	NOUN
ap-1008	88	5	from	from	ADP
ap-1008	88	6	ll(k	ll(k	NOUN
ap-1008	88	7	)	)	PUNCT
ap-1008	88	8	top	top	ADJ
ap-1008	88	9	-	-	PUNCT
ap-1008	88	10	down	down	ADP
ap-1008	88	11	parsing	parsing	NOUN
ap-1008	88	12	,	,	PUNCT
ap-1008	88	13	where	where	SCONJ
ap-1008	88	14	each	each	DET
ap-1008	88	15	state	state	NOUN
ap-1008	88	16	could	could	AUX
ap-1008	88	17	be	be	AUX
ap-1008	88	18	represented	represent	VERB
ap-1008	88	19	by	by	ADP
ap-1008	88	20	a	a	DET
ap-1008	88	21	function	function	NOUN
ap-1008	88	22	calling	call	VERB
ap-1008	88	23	recursively	recursively	ADV
ap-1008	88	24	a	a	DET
ap-1008	88	25	function	function	NOUN
ap-1008	88	26	representing	represent	VERB
ap-1008	88	27	the	the	DET
ap-1008	88	28	following	follow	VERB
ap-1008	88	29	state	state	NOUN
ap-1008	88	30	.	.	PUNCT
ap-1008	89	1	in	in	ADP
ap-1008	89	2	such	such	DET
ap-1008	89	3	a	a	DET
ap-1008	89	4	case	case	NOUN
ap-1008	89	5	the	the	DET
ap-1008	89	6	system	system	NOUN
ap-1008	89	7	stack	stack	NOUN
ap-1008	89	8	would	would	AUX
ap-1008	89	9	overflow	overflow	VERB
ap-1008	89	10	since	since	SCONJ
ap-1008	89	11	dfa	dfa	PROPN
ap-1008	89	12	would	would	AUX
ap-1008	89	13	return	return	VERB
ap-1008	89	14	from	from	ADP
ap-1008	89	15	the	the	DET
ap-1008	89	16	function	function	NOUN
ap-1008	89	17	calls	call	VERB
ap-1008	89	18	only	only	ADV
ap-1008	89	19	at	at	ADP
ap-1008	89	20	the	the	DET
ap-1008	89	21	end	end	NOUN
ap-1008	89	22	of	of	ADP
ap-1008	89	23	the	the	DET
ap-1008	89	24	run	run	NOUN
ap-1008	89	25	.	.	PUNCT
ap-1008	90	1	there	there	PRON
ap-1008	90	2	would	would	AUX
ap-1008	90	3	be	be	AUX
ap-1008	90	4	as	as	ADV
ap-1008	90	5	many	many	ADJ
ap-1008	90	6	nested	nested	ADJ
ap-1008	90	7	function	function	NOUN
ap-1008	90	8	calls	call	NOUN
ap-1008	90	9	as	as	ADP
ap-1008	90	10	the	the	DET
ap-1008	90	11	size	size	NOUN
ap-1008	90	12	of	of	ADP
ap-1008	90	13	the	the	DET
ap-1008	90	14	input	input	NOUN
ap-1008	90	15	text	text	NOUN
ap-1008	90	16	.	.	PUNCT
ap-1008	91	1	however	however	ADV
ap-1008	91	2	,	,	PUNCT
ap-1008	91	3	ngassam	ngassam	PROPN
ap-1008	91	4	’s	’s	PART
ap-1008	91	5	implementation	implementation	NOUN
ap-1008	91	6	[	[	X
ap-1008	91	7	18	18	NUM
ap-1008	91	8	]	]	PUNCT
ap-1008	91	9	uses	use	VERB
ap-1008	91	10	a	a	DET
ap-1008	91	11	function	function	NOUN
ap-1008	91	12	for	for	ADP
ap-1008	91	13	each	each	DET
ap-1008	91	14	state	state	NOUN
ap-1008	91	15	,	,	PUNCT
ap-1008	91	16	but	but	CCONJ
ap-1008	91	17	the	the	DET
ap-1008	91	18	function	function	NOUN
ap-1008	91	19	(	(	PUNCT
ap-1008	91	20	with	with	SCONJ
ap-1008	91	21	the	the	DET
ap-1008	91	22	current	current	ADJ
ap-1008	91	23	input	input	NOUN
ap-1008	91	24	symbol	symbol	NOUN
ap-1008	91	25	given	give	VERB
ap-1008	91	26	as	as	ADP
ap-1008	91	27	a	a	DET
ap-1008	91	28	parameter	parameter	NOUN
ap-1008	91	29	)	)	PUNCT
ap-1008	91	30	returns	return	VERB
ap-1008	91	31	an	an	DET
ap-1008	91	32	index	index	NOUN
ap-1008	91	33	of	of	ADP
ap-1008	91	34	the	the	DET
ap-1008	91	35	next	next	ADJ
ap-1008	91	36	state	state	NOUN
ap-1008	91	37	and	and	CCONJ
ap-1008	91	38	then	then	ADV
ap-1008	91	39	the	the	DET
ap-1008	91	40	next	next	ADJ
ap-1008	91	41	state	state	NOUN
ap-1008	91	42	function	function	NOUN
ap-1008	91	43	(	(	PUNCT
ap-1008	91	44	with	with	ADP
ap-1008	91	45	the	the	DET
ap-1008	91	46	next	next	ADJ
ap-1008	91	47	input	input	NOUN
ap-1008	91	48	symbol	symbol	NOUN
ap-1008	91	49	given	give	VERB
ap-1008	91	50	as	as	ADP
ap-1008	91	51	a	a	DET
ap-1008	91	52	parameter	parameter	NOUN
ap-1008	91	53	)	)	PUNCT
ap-1008	91	54	is	be	AUX
ap-1008	91	55	called	call	VERB
ap-1008	91	56	.	.	PUNCT
ap-1008	92	1	52	52	NUM
ap-1008	92	2	©	©	PROPN
ap-1008	92	3	czech	czech	PROPN
ap-1008	92	4	technical	technical	PROPN
ap-1008	92	5	university	university	PROPN
ap-1008	92	6	publishing	publishing	NOUN
ap-1008	92	7	house	house	NOUN
ap-1008	92	8	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-1008	92	9	acta	acta	PROPN
ap-1008	92	10	polytechnica	polytechnica	PROPN
ap-1008	92	11	vol	vol	NOUN
ap-1008	92	12	.	.	PUNCT
ap-1008	93	1	47	47	NUM
ap-1008	93	2	no	no	NOUN
ap-1008	93	3	.	.	PUNCT
ap-1008	94	1	6/2007	6/2007	NUM
ap-1008	94	2	2	2	NUM
ap-1008	94	3	b	b	NOUN
ap-1008	94	4	0	0	NUM
ap-1008	94	5	3	3	NUM
ap-1008	94	6	41	41	NUM
ap-1008	94	7	a	a	DET
ap-1008	94	8	dc	dc	PROPN
ap-1008	94	9	1	1	NUM
ap-1008	94	10	4	4	NUM
ap-1008	94	11	4	4	NUM
ap-1008	94	12	4	4	NUM
ap-1008	94	13	3	3	NUM
ap-1008	94	14	3	3	NUM
ap-1008	94	15	2	2	NUM
ap-1008	94	16	int	int	NOUN
ap-1008	94	17	dfa_td	dfa_td	PROPN
ap-1008	94	18	(	(	PUNCT
ap-1008	94	19	)	)	PUNCT
ap-1008	94	20	{	{	PUNCT
ap-1008	94	21	int	int	NOUN
ap-1008	94	22	state=0,symbol	state=0,symbol	NOUN
ap-1008	94	23	;	;	PUNCT
ap-1008	94	24	while((symbol=	while((symbol=	NOUN
ap-1008	94	25	getchar())!=	getchar())!=	PROPN
ap-1008	94	26	eof	eof	VERB
ap-1008	94	27	)	)	PUNCT
ap-1008	94	28	{	{	PUNCT
ap-1008	94	29	state=	state=	NUM
ap-1008	94	30	transition_table[state][symbol	transition_table[state][symbol	PROPN
ap-1008	94	31	]	]	X
ap-1008	94	32	;	;	PUNCT
ap-1008	94	33	}	}	PUNCT
ap-1008	94	34	returnis_final[state	returnis_final[state	VERB
ap-1008	94	35	]	]	PUNCT
ap-1008	94	36	;	;	PUNCT
ap-1008	94	37	}	}	PUNCT
ap-1008	94	38	transition_table	transition_table	ADJ
ap-1008	94	39	:	:	PUNCT
ap-1008	94	40	fig	fig	NOUN
ap-1008	94	41	.	.	PUNCT
ap-1008	95	1	3	3	NUM
ap-1008	95	2	:	:	PUNCT
ap-1008	95	3	table	table	NOUN
ap-1008	95	4	driven	drive	VERB
ap-1008	95	5	implementation	implementation	NOUN
ap-1008	95	6	of	of	ADP
ap-1008	95	7	dfa	dfa	PROPN
ap-1008	95	8	from	from	ADP
ap-1008	95	9	fig	fig	NOUN
ap-1008	95	10	.	.	PUNCT
ap-1008	96	1	2	2	NUM
ap-1008	96	2	4	4	NUM
ap-1008	96	3	dfa	dfa	NOUN
ap-1008	96	4	with	with	ADP
ap-1008	96	5	cycles	cycle	NOUN
ap-1008	96	6	td	td	NOUN
ap-1008	96	7	and	and	CCONJ
ap-1008	96	8	hc	hc	NOUN
ap-1008	96	9	implementations	implementation	NOUN
ap-1008	96	10	(	(	PUNCT
ap-1008	96	11	and	and	CCONJ
ap-1008	96	12	their	their	PRON
ap-1008	96	13	combination	combination	NOUN
ap-1008	96	14	called	call	VERB
ap-1008	96	15	mixed	mixed	ADJ
ap-1008	96	16	-	-	PUNCT
ap-1008	96	17	mode	mode	NOUN
ap-1008	96	18	–	–	PUNCT
ap-1008	96	19	mm	mm	NOUN
ap-1008	96	20	)	)	PUNCT
ap-1008	96	21	were	be	AUX
ap-1008	96	22	heavily	heavily	ADV
ap-1008	96	23	examined	examine	VERB
ap-1008	96	24	by	by	ADP
ap-1008	96	25	ngassam	ngassam	PROPN
ap-1008	96	26	[	[	X
ap-1008	96	27	20	20	NUM
ap-1008	96	28	,	,	PUNCT
ap-1008	96	29	18	18	NUM
ap-1008	96	30	]	]	PUNCT
ap-1008	96	31	.	.	PUNCT
ap-1008	97	1	his	his	PRON
ap-1008	97	2	implementations	implementation	NOUN
ap-1008	97	3	use	use	VERB
ap-1008	97	4	a	a	DET
ap-1008	97	5	data	data	NOUN
ap-1008	97	6	structure	structure	NOUN
ap-1008	97	7	that	that	PRON
ap-1008	97	8	most	most	ADV
ap-1008	97	9	likely	likely	ADV
ap-1008	97	10	will	will	AUX
ap-1008	97	11	be	be	AUX
ap-1008	97	12	stored	store	VERB
ap-1008	97	13	in	in	ADP
ap-1008	97	14	cpu	cpu	PROPN
ap-1008	97	15	cache	cache	NOUN
ap-1008	97	16	.	.	PUNCT
ap-1008	98	1	for	for	ADP
ap-1008	98	2	each	each	PRON
ap-1008	98	3	of	of	ADP
ap-1008	98	4	td	td	NOUN
ap-1008	98	5	and	and	CCONJ
ap-1008	98	6	hc	hc	PROPN
ap-1008	98	7	implementationshe	implementationshe	PROPN
ap-1008	98	8	developed	develop	VERB
ap-1008	98	9	three	three	NUM
ap-1008	98	10	strategies	strategy	NOUN
ap-1008	98	11	to	to	PART
ap-1008	98	12	use	use	VERB
ap-1008	98	13	cpu	cpu	NOUN
ap-1008	98	14	cache	cache	NOUN
ap-1008	98	15	efficiently	efficiently	ADV
ap-1008	98	16	:	:	PUNCT
ap-1008	98	17	dynamic	dynamic	ADJ
ap-1008	98	18	state	state	NOUN
ap-1008	98	19	allocation	allocation	NOUN
ap-1008	98	20	(	(	PUNCT
ap-1008	98	21	dsa	dsa	PROPN
ap-1008	98	22	)	)	PUNCT
ap-1008	98	23	,	,	PUNCT
ap-1008	98	24	state	state	NOUN
ap-1008	98	25	pre	pre	ADJ
ap-1008	98	26	-	-	ADJ
ap-1008	98	27	ordering	ordering	ADJ
ap-1008	98	28	(	(	PUNCT
ap-1008	98	29	spo	spo	PROPN
ap-1008	98	30	)	)	PUNCT
ap-1008	98	31	,	,	PUNCT
ap-1008	98	32	and	and	CCONJ
ap-1008	98	33	allocated	allocate	VERB
ap-1008	98	34	virtual	virtual	ADJ
ap-1008	98	35	caching	cache	VERB
ap-1008	98	36	(	(	PUNCT
ap-1008	98	37	avc	avc	PROPN
ap-1008	98	38	)	)	PUNCT
ap-1008	98	39	.	.	PUNCT
ap-1008	99	1	dsa	dsa	PROPN
ap-1008	99	2	strategy	strategy	NOUN
ap-1008	99	3	has	have	AUX
ap-1008	99	4	been	be	AUX
ap-1008	99	5	suggested	suggest	VERB
ap-1008	99	6	in	in	ADP
ap-1008	99	7	[	[	X
ap-1008	99	8	19	19	NUM
ap-1008	99	9	]	]	PUNCT
ap-1008	99	10	and	and	CCONJ
ap-1008	99	11	was	be	AUX
ap-1008	99	12	proved	prove	VERB
ap-1008	99	13	to	to	PART
ap-1008	99	14	outperform	outperform	VERB
ap-1008	99	15	td	td	NOUN
ap-1008	99	16	when	when	SCONJ
ap-1008	99	17	a	a	DET
ap-1008	99	18	large	large	ADJ
ap-1008	99	19	-	-	PUNCT
ap-1008	99	20	scale	scale	NOUN
ap-1008	99	21	dfa	dfa	NOUN
ap-1008	99	22	is	be	AUX
ap-1008	99	23	used	use	VERB
ap-1008	99	24	to	to	PART
ap-1008	99	25	recognize	recognize	VERB
ap-1008	99	26	very	very	ADV
ap-1008	99	27	long	long	ADJ
ap-1008	99	28	strings	string	NOUN
ap-1008	99	29	that	that	PRON
ap-1008	99	30	tend	tend	VERB
ap-1008	99	31	to	to	PART
ap-1008	99	32	repeatedly	repeatedly	ADV
ap-1008	99	33	visit	visit	VERB
ap-1008	99	34	the	the	DET
ap-1008	99	35	same	same	ADJ
ap-1008	99	36	set	set	NOUN
ap-1008	99	37	of	of	ADP
ap-1008	99	38	states	state	NOUN
ap-1008	99	39	.	.	PUNCT
ap-1008	100	1	spo	spo	PROPN
ap-1008	100	2	relies	rely	VERB
ap-1008	100	3	on	on	ADP
ap-1008	100	4	a	a	DET
ap-1008	100	5	degree	degree	NOUN
ap-1008	100	6	of	of	ADP
ap-1008	100	7	prior	prior	ADJ
ap-1008	100	8	knowledge	knowledge	NOUN
ap-1008	100	9	about	about	ADP
ap-1008	100	10	the	the	DET
ap-1008	100	11	orderin	orderin	NOUN
ap-1008	100	12	which	which	PRON
ap-1008	100	13	states	state	NOUN
ap-1008	100	14	are	be	AUX
ap-1008	100	15	likely	likely	ADJ
ap-1008	100	16	to	to	PART
ap-1008	100	17	be	be	AUX
ap-1008	100	18	visited	visit	VERB
ap-1008	100	19	at	at	ADP
ap-1008	100	20	run	run	NOUN
ap-1008	100	21	-	-	PUNCT
ap-1008	100	22	time	time	NOUN
ap-1008	100	23	.	.	PUNCT
ap-1008	101	1	it	it	PRON
ap-1008	101	2	was	be	AUX
ap-1008	101	3	shown	show	VERB
ap-1008	101	4	that	that	SCONJ
ap-1008	101	5	the	the	DET
ap-1008	101	6	associated	associated	ADJ
ap-1008	101	7	algorithm	algorithm	NOUN
ap-1008	101	8	outperforms	outperform	VERB
ap-1008	101	9	its	its	PRON
ap-1008	101	10	td	td	NOUN
ap-1008	101	11	counterpart	counterpart	NOUN
ap-1008	101	12	no	no	ADV
ap-1008	101	13	matter	matter	ADV
ap-1008	101	14	the	the	DET
ap-1008	101	15	kind	kind	NOUN
ap-1008	101	16	of	of	ADP
ap-1008	101	17	string	string	NOUN
ap-1008	101	18	being	be	AUX
ap-1008	101	19	processed	process	VERB
ap-1008	101	20	.	.	PUNCT
ap-1008	102	1	avc	avc	PROPN
ap-1008	102	2	strategy	strategy	NOUN
ap-1008	102	3	reorders	reorder	NOUN
ap-1008	102	4	the	the	DET
ap-1008	102	5	transition	transition	NOUN
ap-1008	102	6	table	table	NOUN
ap-1008	102	7	at	at	ADP
ap-1008	102	8	run	run	NOUN
ap-1008	102	9	time	time	NOUN
ap-1008	102	10	and	and	CCONJ
ap-1008	102	11	also	also	ADV
ap-1008	102	12	leads	lead	VERB
ap-1008	102	13	to	to	ADP
ap-1008	102	14	better	well	ADJ
ap-1008	102	15	performance	performance	NOUN
ap-1008	102	16	when	when	SCONJ
ap-1008	102	17	processing	processing	NOUN
ap-1008	102	18	strings	string	NOUN
ap-1008	102	19	that	that	PRON
ap-1008	102	20	visit	visit	VERB
ap-1008	102	21	a	a	DET
ap-1008	102	22	limited	limited	ADJ
ap-1008	102	23	number	number	NOUN
ap-1008	102	24	of	of	ADP
ap-1008	102	25	states	state	NOUN
ap-1008	102	26	.	.	PUNCT
ap-1008	103	1	ngassam	ngassam	PROPN
ap-1008	103	2	’s	’s	PART
ap-1008	103	3	approach	approach	NOUN
ap-1008	103	4	can	can	AUX
ap-1008	103	5	be	be	AUX
ap-1008	103	6	efficiently	efficiently	ADV
ap-1008	103	7	exploited	exploit	VERB
ap-1008	103	8	in	in	ADP
ap-1008	103	9	dfa	dfa	PROPN
ap-1008	103	10	,	,	PUNCT
ap-1008	103	11	where	where	SCONJ
ap-1008	103	12	some	some	DET
ap-1008	103	13	states	state	NOUN
ap-1008	103	14	are	be	AUX
ap-1008	103	15	frequently	frequently	ADV
ap-1008	103	16	visited	visit	VERB
ap-1008	103	17	(	(	PUNCT
ap-1008	103	18	like	like	INTJ
ap-1008	103	19	in	in	ADP
ap-1008	103	20	dfa	dfa	NOUN
ap-1008	103	21	with	with	ADP
ap-1008	103	22	cycles	cycle	NOUN
ap-1008	103	23	)	)	PUNCT
ap-1008	103	24	.	.	PUNCT
ap-1008	104	1	in	in	ADP
ap-1008	104	2	both	both	PRON
ap-1008	104	3	td	td	NOUN
ap-1008	104	4	and	and	CCONJ
ap-1008	104	5	hc	hc	PROPN
ap-1008	104	6	ngassam	ngassam	PROPN
ap-1008	104	7	’s	’s	PART
ap-1008	104	8	implementations	implementation	NOUN
ap-1008	104	9	the	the	DET
ap-1008	104	10	transition	transition	NOUN
ap-1008	104	11	table	table	NOUN
ap-1008	104	12	is	be	AUX
ap-1008	104	13	expected	expect	VERB
ap-1008	104	14	to	to	PART
ap-1008	104	15	have	have	VERB
ap-1008	104	16	the	the	DET
ap-1008	104	17	same	same	ADJ
ap-1008	104	18	number	number	NOUN
ap-1008	104	19	of	of	ADP
ap-1008	104	20	items	item	NOUN
ap-1008	104	21	in	in	ADP
ap-1008	104	22	each	each	DET
ap-1008	104	23	row	row	NOUN
ap-1008	104	24	(	(	PUNCT
ap-1008	104	25	i.e.	i.e.	X
ap-1008	104	26	,	,	PUNCT
ap-1008	104	27	each	each	DET
ap-1008	104	28	state	state	NOUN
ap-1008	104	29	having	have	VERB
ap-1008	104	30	the	the	DET
ap-1008	104	31	same	same	ADJ
ap-1008	104	32	number	number	NOUN
ap-1008	104	33	of	of	ADP
ap-1008	104	34	outgoing	outgoing	ADJ
ap-1008	104	35	transitions	transition	NOUN
ap-1008	104	36	)	)	PUNCT
ap-1008	104	37	.	.	PUNCT
ap-1008	105	1	ngassam	ngassam	PROPN
ap-1008	105	2	’s	’s	PART
ap-1008	105	3	implementation	implementation	NOUN
ap-1008	105	4	uses	use	VERB
ap-1008	105	5	a	a	DET
ap-1008	105	6	fixed	fix	VERB
ap-1008	105	7	-	-	PUNCT
ap-1008	105	8	size	size	NOUN
ap-1008	105	9	structure	structure	NOUN
ap-1008	105	10	for	for	ADP
ap-1008	105	11	each	each	DET
ap-1008	105	12	row	row	NOUN
ap-1008	105	13	of	of	ADP
ap-1008	105	14	the	the	DET
ap-1008	105	15	transition	transition	NOUN
ap-1008	105	16	table	table	NOUN
ap-1008	105	17	.	.	PUNCT
ap-1008	106	1	therefore	therefore	ADV
ap-1008	106	2	for	for	ADP
ap-1008	106	3	sparse	sparse	ADJ
ap-1008	106	4	transition	transition	NOUN
ap-1008	106	5	matrix	matrix	NOUN
ap-1008	106	6	the	the	DET
ap-1008	106	7	method	method	NOUN
ap-1008	106	8	is	be	AUX
ap-1008	106	9	not	not	PART
ap-1008	106	10	so	so	ADV
ap-1008	106	11	memory	memory	NOUN
ap-1008	106	12	efficient	efficient	ADJ
ap-1008	106	13	.	.	PUNCT
ap-1008	107	1	5	5	NUM
ap-1008	107	2	acyclic	acyclic	ADJ
ap-1008	107	3	dfa	dfa	NOUN
ap-1008	107	4	another	another	DET
ap-1008	107	5	approach	approach	NOUN
ap-1008	107	6	is	be	AUX
ap-1008	107	7	used	use	VERB
ap-1008	107	8	for	for	ADP
ap-1008	107	9	acyclic	acyclic	ADJ
ap-1008	107	10	dfa	dfa	NOUN
ap-1008	107	11	.	.	PUNCT
ap-1008	108	1	in	in	ADP
ap-1008	108	2	these	these	DET
ap-1008	108	3	automata	automata	NOUN
ap-1008	108	4	each	each	DET
ap-1008	108	5	state	state	NOUN
ap-1008	108	6	is	be	AUX
ap-1008	108	7	visited	visit	VERB
ap-1008	108	8	just	just	ADV
ap-1008	108	9	once	once	ADV
ap-1008	108	10	during	during	ADP
ap-1008	108	11	the	the	DET
ap-1008	108	12	dfa	dfa	PROPN
ap-1008	108	13	run	run	NOUN
ap-1008	108	14	.	.	PUNCT
ap-1008	109	1	suffix	suffix	ADJ
ap-1008	109	2	automaton	automaton	NOUN
ap-1008	109	3	and	and	CCONJ
ap-1008	109	4	factor	factor	NOUN
ap-1008	109	5	automaton	automaton	NOUN
ap-1008	109	6	(	(	PUNCT
ap-1008	109	7	automaton	automaton	NOUN
ap-1008	109	8	recognizing	recognize	VERB
ap-1008	109	9	all	all	DET
ap-1008	109	10	suffixes	suffix	NOUN
ap-1008	109	11	and	and	CCONJ
ap-1008	109	12	factors	factor	NOUN
ap-1008	109	13	of	of	ADP
ap-1008	109	14	the	the	DET
ap-1008	109	15	given	give	VERB
ap-1008	109	16	string	string	NOUN
ap-1008	109	17	,	,	PUNCT
ap-1008	109	18	respectively	respectively	ADV
ap-1008	109	19	)	)	PUNCT
ap-1008	110	1	[	[	X
ap-1008	110	2	3	3	NUM
ap-1008	110	3	,	,	PUNCT
ap-1008	110	4	4	4	NUM
ap-1008	110	5	]	]	PUNCT
ap-1008	110	6	are	be	AUX
ap-1008	110	7	of	of	ADP
ap-1008	110	8	such	such	ADJ
ap-1008	110	9	kind	kind	NOUN
ap-1008	110	10	.	.	PUNCT
ap-1008	111	1	given	give	VERB
ap-1008	111	2	a	a	DET
ap-1008	111	3	pattern	pattern	NOUN
ap-1008	111	4	they	they	PRON
ap-1008	111	5	verify	verify	VERB
ap-1008	111	6	if	if	SCONJ
ap-1008	111	7	the	the	DET
ap-1008	111	8	pattern	pattern	NOUN
ap-1008	111	9	is	be	AUX
ap-1008	111	10	a	a	DET
ap-1008	111	11	suffix	suffix	NOUN
ap-1008	111	12	or	or	CCONJ
ap-1008	111	13	a	a	DET
ap-1008	111	14	factor	factor	NOUN
ap-1008	111	15	of	of	ADP
ap-1008	111	16	the	the	DET
ap-1008	111	17	original	original	ADJ
ap-1008	111	18	string	string	NOUN
ap-1008	111	19	in	in	ADP
ap-1008	111	20	time	time	NOUN
ap-1008	111	21	linear	linear	ADJ
ap-1008	111	22	with	with	ADP
ap-1008	111	23	the	the	DET
ap-1008	111	24	length	length	NOUN
ap-1008	111	25	of	of	ADP
ap-1008	111	26	pattern	pattern	NOUN
ap-1008	111	27	regardless	regardless	ADV
ap-1008	111	28	the	the	DET
ap-1008	111	29	size	size	NOUN
ap-1008	111	30	of	of	ADP
ap-1008	111	31	the	the	DET
ap-1008	111	32	original	original	ADJ
ap-1008	111	33	string	string	NOUN
ap-1008	111	34	.	.	PUNCT
ap-1008	112	1	an	an	DET
ap-1008	112	2	efficient	efficient	ADJ
ap-1008	112	3	implementation	implementation	NOUN
ap-1008	112	4	of	of	ADP
ap-1008	112	5	the	the	DET
ap-1008	112	6	suffix	suffix	PROPN
ap-1008	112	7	automaton	automaton	NOUN
ap-1008	112	8	(	(	PUNCT
ap-1008	112	9	also	also	ADV
ap-1008	112	10	called	call	VERB
ap-1008	112	11	dawg	dawg	ADJ
ap-1008	112	12	–	–	PUNCT
ap-1008	112	13	direct	direct	ADJ
ap-1008	112	14	acyclic	acyclic	ADJ
ap-1008	112	15	word	word	NOUN
ap-1008	112	16	graph	graph	NOUN
ap-1008	112	17	)	)	PUNCT
ap-1008	112	18	was	be	AUX
ap-1008	112	19	created	create	VERB
ap-1008	112	20	by	by	ADP
ap-1008	112	21	balík	balík	NOUN
ap-1008	112	22	[	[	X
ap-1008	112	23	2	2	NUM
ap-1008	112	24	]	]	PUNCT
ap-1008	112	25	.	.	PUNCT
ap-1008	113	1	an	an	DET
ap-1008	113	2	implementation	implementation	NOUN
ap-1008	113	3	of	of	ADP
ap-1008	113	4	the	the	DET
ap-1008	113	5	compact	compact	ADJ
ap-1008	113	6	version	version	NOUN
ap-1008	113	7	of	of	ADP
ap-1008	113	8	the	the	DET
ap-1008	113	9	suffix	suffix	PROPN
ap-1008	113	10	automaton	automaton	NOUN
ap-1008	113	11	called	call	VERB
ap-1008	113	12	compact	compact	ADJ
ap-1008	113	13	suffix	suffix	NOUN
ap-1008	113	14	automaton	automaton	NOUN
ap-1008	113	15	(	(	PUNCT
ap-1008	113	16	also	also	ADV
ap-1008	113	17	called	call	VERB
ap-1008	113	18	compact	compact	ADJ
ap-1008	113	19	dawg	dawg	NOUN
ap-1008	113	20	)	)	PUNCT
ap-1008	113	21	was	be	AUX
ap-1008	113	22	presented	present	VERB
ap-1008	113	23	by	by	ADP
ap-1008	113	24	crochemore	crochemore	NOUN
ap-1008	113	25	and	and	CCONJ
ap-1008	113	26	holub	holub	NOUN
ap-1008	113	27	in	in	ADP
ap-1008	113	28	[	[	X
ap-1008	113	29	9	9	NUM
ap-1008	113	30	]	]	PUNCT
ap-1008	113	31	.	.	PUNCT
ap-1008	114	1	both	both	DET
ap-1008	114	2	these	these	DET
ap-1008	114	3	implementations	implementation	NOUN
ap-1008	114	4	are	be	AUX
ap-1008	114	5	very	very	ADV
ap-1008	114	6	efficient	efficient	ADJ
ap-1008	114	7	in	in	ADP
ap-1008	114	8	terms	term	NOUN
ap-1008	114	9	of	of	ADP
ap-1008	114	10	memory	memory	NOUN
ap-1008	114	11	used	use	VERB
ap-1008	114	12	(	(	PUNCT
ap-1008	114	13	about	about	ADP
ap-1008	114	14	1.1–5	1.1–5	NUM
ap-1008	114	15	bytes	byte	NOUN
ap-1008	114	16	per	per	ADP
ap-1008	114	17	input	input	NOUN
ap-1008	114	18	string	string	NOUN
ap-1008	114	19	symbol	symbol	NOUN
ap-1008	114	20	)	)	PUNCT
ap-1008	114	21	.	.	PUNCT
ap-1008	115	1	the	the	DET
ap-1008	115	2	factor	factor	NOUN
ap-1008	115	3	and	and	CCONJ
ap-1008	115	4	suffix	suffix	NOUN
ap-1008	115	5	automata	automata	NOUN
ap-1008	115	6	are	be	AUX
ap-1008	115	7	usually	usually	ADV
ap-1008	115	8	built	build	VERB
ap-1008	115	9	over	over	ADP
ap-1008	115	10	whole	whole	ADJ
ap-1008	115	11	texts	text	NOUN
ap-1008	115	12	typically	typically	ADV
ap-1008	115	13	several	several	ADJ
ap-1008	115	14	megabytes	megabyte	NOUN
ap-1008	115	15	long	long	ADJ
ap-1008	115	16	.	.	PUNCT
ap-1008	116	1	instead	instead	ADV
ap-1008	116	2	of	of	ADP
ap-1008	116	3	storing	store	VERB
ap-1008	116	4	the	the	DET
ap-1008	116	5	transition	transition	NOUN
ap-1008	116	6	tableas	tablea	VERB
ap-1008	116	7	a	a	DET
ap-1008	116	8	matrix	matrix	NOUN
ap-1008	116	9	like	like	ADP
ap-1008	116	10	in	in	ADP
ap-1008	116	11	td	td	NOUN
ap-1008	116	12	implementation	implementation	NOUN
ap-1008	116	13	,	,	PUNCT
ap-1008	116	14	whole	whole	ADJ
ap-1008	116	15	automaton	automaton	NOUN
ap-1008	116	16	is	be	AUX
ap-1008	116	17	used	use	VERB
ap-1008	116	18	in	in	ADP
ap-1008	116	19	a	a	DET
ap-1008	116	20	bit	bit	NOUN
ap-1008	116	21	stream	stream	NOUN
ap-1008	116	22	.	.	PUNCT
ap-1008	117	1	the	the	DET
ap-1008	117	2	bit	bit	NOUN
ap-1008	117	3	stream	stream	NOUN
ap-1008	117	4	contains	contain	VERB
ap-1008	117	5	a	a	DET
ap-1008	117	6	sequence	sequence	NOUN
ap-1008	117	7	of	of	ADP
ap-1008	117	8	states	state	NOUN
ap-1008	117	9	each	each	PRON
ap-1008	117	10	containing	contain	VERB
ap-1008	117	11	a	a	DET
ap-1008	117	12	list	list	NOUN
ap-1008	117	13	of	of	ADP
ap-1008	117	14	all	all	DET
ap-1008	117	15	outgoing	outgoing	ADJ
ap-1008	117	16	transitions	transition	NOUN
ap-1008	117	17	(	(	PUNCT
ap-1008	117	18	i.e.	i.e.	X
ap-1008	117	19	,	,	PUNCT
ap-1008	117	20	sparse	sparse	ADJ
ap-1008	117	21	matrix	matrix	NOUN
ap-1008	117	22	representation	representation	NOUN
ap-1008	117	23	)	)	PUNCT
ap-1008	117	24	.	.	PUNCT
ap-1008	118	1	©	©	PROPN
ap-1008	118	2	czech	czech	PROPN
ap-1008	118	3	technical	technical	PROPN
ap-1008	118	4	university	university	PROPN
ap-1008	118	5	publishing	publishing	NOUN
ap-1008	118	6	house	house	NOUN
ap-1008	118	7	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-1008	118	8	53	53	NUM
ap-1008	118	9	acta	acta	PROPN
ap-1008	118	10	polytechnica	polytechnica	PROPN
ap-1008	118	11	vol	vol	NOUN
ap-1008	118	12	.	.	PUNCT
ap-1008	119	1	47	47	NUM
ap-1008	119	2	no	no	NOUN
ap-1008	119	3	.	.	PUNCT
ap-1008	120	1	6/2007	6/2007	NUM
ap-1008	120	2	int	int	NOUN
ap-1008	120	3	dfa_hc	dfa_hc	PROPN
ap-1008	120	4	(	(	PUNCT
ap-1008	120	5	)	)	PUNCT
ap-1008	120	6	{	{	PUNCT
ap-1008	120	7	int	int	NOUN
ap-1008	120	8	symbol	symbol	NOUN
ap-1008	120	9	;	;	PUNCT
ap-1008	120	10	state0	state0	NOUN
ap-1008	120	11	:	:	PUNCT
ap-1008	120	12	if	if	SCONJ
ap-1008	120	13	(	(	PUNCT
ap-1008	120	14	(	(	PUNCT
ap-1008	120	15	symbol=	symbol=	NUM
ap-1008	120	16	getchar())==	getchar())==	NUM
ap-1008	120	17	eof	eof	NOUN
ap-1008	120	18	)	)	PUNCT
ap-1008	120	19	return0	return0	PROPN
ap-1008	120	20	;	;	PUNCT
ap-1008	120	21	switch(symbol	switch(symbol	PROPN
ap-1008	120	22	)	)	PUNCT
ap-1008	120	23	{	{	PUNCT
ap-1008	120	24	case	case	NOUN
ap-1008	120	25	’	'	PUNCT
ap-1008	120	26	a	a	DET
ap-1008	120	27	’	'	PUNCT
ap-1008	120	28	:	:	PUNCT
ap-1008	120	29	goto	goto	NOUN
ap-1008	120	30	state1	state1	NOUN
ap-1008	120	31	;	;	PUNCT
ap-1008	120	32	case	case	NOUN
ap-1008	120	33	’d	’d	NUM
ap-1008	120	34	’	'	PUNCT
ap-1008	120	35	:	:	PUNCT
ap-1008	120	36	goto	goto	PROPN
ap-1008	120	37	state4	state4	NOUN
ap-1008	120	38	;	;	PUNCT
ap-1008	120	39	default	default	NOUN
ap-1008	120	40	:	:	PUNCT
ap-1008	120	41	return(-1	return(-1	NUM
ap-1008	120	42	)	)	PUNCT
ap-1008	120	43	;	;	PUNCT
ap-1008	120	44	}	}	PUNCT
ap-1008	120	45	;	;	PUNCT
ap-1008	120	46	state1	state1	NOUN
ap-1008	120	47	:	:	PUNCT
ap-1008	120	48	if	if	SCONJ
ap-1008	120	49	(	(	PUNCT
ap-1008	120	50	(	(	PUNCT
ap-1008	120	51	symbol=	symbol=	NUM
ap-1008	120	52	getchar())==	getchar())==	NUM
ap-1008	120	53	eof	eof	NOUN
ap-1008	120	54	)	)	PUNCT
ap-1008	120	55	return0	return0	PROPN
ap-1008	120	56	;	;	PUNCT
ap-1008	120	57	switch(symbol	switch(symbol	PROPN
ap-1008	120	58	)	)	PUNCT
ap-1008	120	59	{	{	PUNCT
ap-1008	120	60	case	case	NOUN
ap-1008	120	61	’	'	PUNCT
ap-1008	120	62	b	b	NOUN
ap-1008	120	63	’	'	PUNCT
ap-1008	120	64	:	:	PUNCT
ap-1008	120	65	goto	goto	NOUN
ap-1008	120	66	state2	state2	NOUN
ap-1008	120	67	;	;	PUNCT
ap-1008	120	68	case	case	NOUN
ap-1008	120	69	’	'	PUNCT
ap-1008	120	70	c	c	ADJ
ap-1008	120	71	’	'	PUNCT
ap-1008	120	72	:	:	PUNCT
ap-1008	120	73	goto	goto	PROPN
ap-1008	120	74	state3	state3	PROPN
ap-1008	120	75	;	;	PUNCT
ap-1008	120	76	default	default	NOUN
ap-1008	120	77	:	:	PUNCT
ap-1008	120	78	return(-1	return(-1	NUM
ap-1008	120	79	)	)	PUNCT
ap-1008	120	80	;	;	PUNCT
ap-1008	120	81	}	}	PUNCT
ap-1008	120	82	;	;	PUNCT
ap-1008	120	83	state2	state2	NOUN
ap-1008	120	84	:	:	PUNCT
ap-1008	120	85	if	if	SCONJ
ap-1008	120	86	(	(	PUNCT
ap-1008	120	87	(	(	PUNCT
ap-1008	120	88	symbol=	symbol=	NUM
ap-1008	120	89	getchar())==	getchar())==	NUM
ap-1008	120	90	eof	eof	NOUN
ap-1008	120	91	)	)	PUNCT
ap-1008	120	92	return0	return0	PROPN
ap-1008	120	93	;	;	PUNCT
ap-1008	120	94	switch(symbol	switch(symbol	PROPN
ap-1008	120	95	)	)	PUNCT
ap-1008	120	96	{	{	PUNCT
ap-1008	120	97	case	case	NOUN
ap-1008	120	98	’	'	PUNCT
ap-1008	120	99	c	c	NOUN
ap-1008	120	100	’	'	PUNCT
ap-1008	120	101	:	:	PUNCT
ap-1008	120	102	goto	goto	PROPN
ap-1008	120	103	state3	state3	PROPN
ap-1008	120	104	;	;	PUNCT
ap-1008	120	105	case	case	NOUN
ap-1008	120	106	’d	’d	NUM
ap-1008	120	107	’	'	PUNCT
ap-1008	120	108	:	:	PUNCT
ap-1008	120	109	goto	goto	PROPN
ap-1008	120	110	state4	state4	NOUN
ap-1008	120	111	;	;	PUNCT
ap-1008	120	112	default	default	NOUN
ap-1008	120	113	:	:	PUNCT
ap-1008	120	114	return(-1	return(-1	NUM
ap-1008	120	115	)	)	PUNCT
ap-1008	120	116	;	;	PUNCT
ap-1008	120	117	}	}	PUNCT
ap-1008	120	118	;	;	PUNCT
ap-1008	120	119	state3	state3	PROPN
ap-1008	120	120	:	:	PUNCT
ap-1008	120	121	if	if	SCONJ
ap-1008	120	122	(	(	PUNCT
ap-1008	120	123	(	(	PUNCT
ap-1008	120	124	symbol=	symbol=	NUM
ap-1008	120	125	getchar())==	getchar())==	NUM
ap-1008	120	126	eof	eof	NOUN
ap-1008	120	127	)	)	PUNCT
ap-1008	120	128	return0	return0	PROPN
ap-1008	120	129	;	;	PUNCT
ap-1008	120	130	switch(symbol	switch(symbol	PROPN
ap-1008	120	131	)	)	PUNCT
ap-1008	120	132	{	{	PUNCT
ap-1008	120	133	case	case	NOUN
ap-1008	120	134	’d	’d	NUM
ap-1008	120	135	’	'	PUNCT
ap-1008	120	136	:	:	PUNCT
ap-1008	120	137	goto	goto	PROPN
ap-1008	120	138	state4	state4	NOUN
ap-1008	120	139	;	;	PUNCT
ap-1008	120	140	default	default	NOUN
ap-1008	120	141	:	:	PUNCT
ap-1008	120	142	return(-1	return(-1	NUM
ap-1008	120	143	)	)	PUNCT
ap-1008	120	144	;	;	PUNCT
ap-1008	120	145	}	}	PUNCT
ap-1008	120	146	;	;	PUNCT
ap-1008	120	147	state4	state4	PROPN
ap-1008	120	148	:	:	PUNCT
ap-1008	120	149	if	if	SCONJ
ap-1008	120	150	(	(	PUNCT
ap-1008	120	151	(	(	PUNCT
ap-1008	120	152	symbol=	symbol=	NUM
ap-1008	120	153	getchar())==	getchar())==	NUM
ap-1008	120	154	eof	eof	NOUN
ap-1008	120	155	)	)	PUNCT
ap-1008	120	156	return1	return1	PROPN
ap-1008	120	157	;	;	PUNCT
ap-1008	120	158	return(-1	return(-1	NUM
ap-1008	120	159	)	)	PUNCT
ap-1008	120	160	;	;	PUNCT
ap-1008	120	161	}	}	PUNCT
ap-1008	120	162	fig	fig	NOUN
ap-1008	120	163	.	.	PUNCT
ap-1008	121	1	4	4	NUM
ap-1008	121	2	:	:	PUNCT
ap-1008	121	3	hard	hard	ADJ
ap-1008	121	4	coded	code	VERB
ap-1008	121	5	implementation	implementation	NOUN
ap-1008	121	6	of	of	ADP
ap-1008	121	7	dfa	dfa	PROPN
ap-1008	121	8	from	from	ADP
ap-1008	121	9	figure	figure	NOUN
ap-1008	121	10	2	2	NUM
ap-1008	121	11	the	the	DET
ap-1008	121	12	key	key	ADJ
ap-1008	121	13	feature	feature	NOUN
ap-1008	121	14	of	of	ADP
ap-1008	121	15	both	both	DET
ap-1008	121	16	implementations	implementation	NOUN
ap-1008	121	17	is	be	AUX
ap-1008	121	18	a	a	DET
ap-1008	121	19	topological	topological	ADJ
ap-1008	121	20	ordering	ordering	NOUN
ap-1008	121	21	of	of	ADP
ap-1008	121	22	states	state	NOUN
ap-1008	121	23	.	.	PUNCT
ap-1008	122	1	it	it	PRON
ap-1008	122	2	ensures	ensure	VERB
ap-1008	122	3	that	that	SCONJ
ap-1008	122	4	we	we	PRON
ap-1008	122	5	never	never	ADV
ap-1008	122	6	get	get	VERB
ap-1008	122	7	back	back	ADV
ap-1008	122	8	in	in	ADP
ap-1008	122	9	the	the	DET
ap-1008	122	10	bit	bit	NOUN
ap-1008	122	11	stream	stream	NOUN
ap-1008	122	12	when	when	SCONJ
ap-1008	122	13	traversing	traverse	VERB
ap-1008	122	14	the	the	DET
ap-1008	122	15	automaton	automaton	NOUN
ap-1008	122	16	.	.	PUNCT
ap-1008	123	1	this	this	PRON
ap-1008	123	2	minimizes	minimize	VERB
ap-1008	123	3	main	main	ADJ
ap-1008	123	4	memory	memory	NOUN
ap-1008	123	5	(	(	PUNCT
ap-1008	123	6	or	or	CCONJ
ap-1008	123	7	hard	hard	ADJ
ap-1008	123	8	disc	disc	NOUN
ap-1008	123	9	drive	drive	NOUN
ap-1008	123	10	)	)	PUNCT
ap-1008	123	11	accesses	access	NOUN
ap-1008	123	12	.	.	PUNCT
ap-1008	124	1	balík	balík	PROPN
ap-1008	124	2	’s	’s	PART
ap-1008	124	3	implementation	implementation	NOUN
ap-1008	124	4	is	be	AUX
ap-1008	124	5	focused	focus	VERB
ap-1008	124	6	on	on	ADP
ap-1008	124	7	the	the	DET
ap-1008	124	8	smallest	small	ADJ
ap-1008	124	9	memory	memory	NOUN
ap-1008	124	10	used	use	VERB
ap-1008	124	11	.	.	PUNCT
ap-1008	125	1	it	it	PRON
ap-1008	125	2	uses	use	VERB
ap-1008	125	3	some	some	DET
ap-1008	125	4	data	datum	NOUN
ap-1008	125	5	compression	compression	NOUN
ap-1008	125	6	techniques	technique	NOUN
ap-1008	125	7	.	.	PUNCT
ap-1008	126	1	it	it	PRON
ap-1008	126	2	also	also	ADV
ap-1008	126	3	exploits	exploit	VERB
ap-1008	126	4	the	the	DET
ap-1008	126	5	fact	fact	NOUN
ap-1008	126	6	that	that	SCONJ
ap-1008	126	7	both	both	PRON
ap-1008	126	8	factor	factor	NOUN
ap-1008	126	9	and	and	CCONJ
ap-1008	126	10	suffix	suffix	NOUN
ap-1008	126	11	automata	automata	NOUN
ap-1008	126	12	are	be	AUX
ap-1008	126	13	homogeneous	homogeneous	ADJ
ap-1008	126	14	automata	automata	NOUN
ap-1008	126	15	[	[	X
ap-1008	126	16	5	5	NUM
ap-1008	126	17	]	]	PUNCT
ap-1008	126	18	,	,	PUNCT
ap-1008	126	19	where	where	SCONJ
ap-1008	126	20	each	each	DET
ap-1008	126	21	state	state	NOUN
ap-1008	126	22	has	have	VERB
ap-1008	126	23	all	all	DET
ap-1008	126	24	incoming	incoming	ADJ
ap-1008	126	25	transitions	transition	NOUN
ap-1008	126	26	labeled	label	VERB
ap-1008	126	27	by	by	ADP
ap-1008	126	28	the	the	DET
ap-1008	126	29	same	same	ADJ
ap-1008	126	30	symbol	symbol	NOUN
ap-1008	126	31	.	.	PUNCT
ap-1008	127	1	therefore	therefore	ADV
ap-1008	127	2	the	the	DET
ap-1008	127	3	label	label	NOUN
ap-1008	127	4	of	of	ADP
ap-1008	127	5	incoming	incoming	ADJ
ap-1008	127	6	transition	transition	NOUN
ap-1008	127	7	is	be	AUX
ap-1008	127	8	stored	store	VERB
ap-1008	127	9	in	in	ADP
ap-1008	127	10	the	the	DET
ap-1008	127	11	destination	destination	NOUN
ap-1008	127	12	state	state	NOUN
ap-1008	127	13	.	.	PUNCT
ap-1008	128	1	the	the	DET
ap-1008	128	2	outgoing	outgoing	ADJ
ap-1008	128	3	transition	transition	NOUN
ap-1008	128	4	then	then	ADV
ap-1008	128	5	only	only	ADV
ap-1008	128	6	points	point	VERB
ap-1008	128	7	to	to	ADP
ap-1008	128	8	the	the	DET
ap-1008	128	9	destination	destination	NOUN
ap-1008	128	10	state	state	NOUN
ap-1008	128	11	,	,	PUNCT
ap-1008	128	12	where	where	SCONJ
ap-1008	128	13	the	the	DET
ap-1008	128	14	corresponding	corresponding	ADJ
ap-1008	128	15	transition	transition	NOUN
ap-1008	128	16	label	label	NOUN
ap-1008	128	17	is	be	AUX
ap-1008	128	18	stored	store	VERB
ap-1008	128	19	.	.	PUNCT
ap-1008	129	1	on	on	ADP
ap-1008	129	2	the	the	DET
ap-1008	129	3	other	other	ADJ
ap-1008	129	4	hand	hand	NOUN
ap-1008	129	5	holub	holub	NOUN
ap-1008	129	6	’s	’s	PART
ap-1008	129	7	implementation	implementation	NOUN
ap-1008	129	8	considers	consider	VERB
ap-1008	129	9	also	also	ADV
ap-1008	129	10	the	the	DET
ap-1008	129	11	speed	speed	NOUN
ap-1008	129	12	of	of	ADP
ap-1008	129	13	traversing	traverse	VERB
ap-1008	129	14	.	.	PUNCT
ap-1008	130	1	each	each	DET
ap-1008	130	2	state	state	NOUN
ap-1008	130	3	contains	contain	VERB
ap-1008	130	4	all	all	DET
ap-1008	130	5	outgoing	outgoing	ADJ
ap-1008	130	6	transitions	transition	NOUN
ap-1008	130	7	together	together	ADV
ap-1008	130	8	with	with	ADP
ap-1008	130	9	their	their	PRON
ap-1008	130	10	transition	transition	NOUN
ap-1008	130	11	labels	label	NOUN
ap-1008	130	12	like	like	ADP
ap-1008	130	13	in	in	ADP
ap-1008	130	14	fig	fig	NOUN
ap-1008	130	15	.	.	PUNCT
ap-1008	131	1	5	5	NUM
ap-1008	131	2	.	.	PUNCT
ap-1008	131	3	(	(	PUNCT
ap-1008	131	4	however	however	ADV
ap-1008	131	5	,	,	PUNCT
ap-1008	131	6	the	the	DET
ap-1008	131	7	dfa	dfa	NOUN
ap-1008	131	8	represented	represent	VERB
ap-1008	131	9	in	in	ADP
ap-1008	131	10	fig	fig	NOUN
ap-1008	131	11	.	.	PUNCT
ap-1008	132	1	5	5	NUM
ap-1008	132	2	is	be	AUX
ap-1008	132	3	neither	neither	CCONJ
ap-1008	132	4	suffix	suffix	ADJ
ap-1008	132	5	nor	nor	CCONJ
ap-1008	132	6	factor	factor	NOUN
ap-1008	132	7	automaton	automaton	NOUN
ap-1008	132	8	.	.	PUNCT
ap-1008	132	9	)	)	PUNCT
ap-1008	133	1	it	it	PRON
ap-1008	133	2	is	be	AUX
ap-1008	133	3	not	not	PART
ap-1008	133	4	so	so	ADV
ap-1008	133	5	memory	memory	NOUN
ap-1008	133	6	efficient	efficient	ADJ
ap-1008	133	7	like	like	ADP
ap-1008	133	8	balík	balík	NOUN
ap-1008	133	9	’s	’s	PART
ap-1008	133	10	implementation	implementation	NOUN
ap-1008	133	11	but	but	CCONJ
ap-1008	133	12	it	it	PRON
ap-1008	133	13	reduces	reduce	VERB
ap-1008	133	14	main	main	ADJ
ap-1008	133	15	memory	memory	NOUN
ap-1008	133	16	(	(	PUNCT
ap-1008	133	17	or	or	CCONJ
ap-1008	133	18	hard	hard	ADJ
ap-1008	133	19	disc	disc	NOUN
ap-1008	133	20	drive	drive	NOUN
ap-1008	133	21	)	)	PUNCT
ap-1008	133	22	accesses	access	NOUN
ap-1008	133	23	.	.	PUNCT
ap-1008	134	1	it	it	PRON
ap-1008	134	2	exploits	exploit	VERB
ap-1008	134	3	the	the	DET
ap-1008	134	4	locality	locality	NOUN
ap-1008	134	5	of	of	ADP
ap-1008	134	6	data	datum	NOUN
ap-1008	134	7	–	–	PUNCT
ap-1008	134	8	principle	principle	NOUN
ap-1008	134	9	used	use	VERB
ap-1008	134	10	by	by	ADP
ap-1008	134	11	cpu	cpu	NOUN
ap-1008	134	12	cache	cache	NOUN
ap-1008	134	13	.	.	PUNCT
ap-1008	135	1	when	when	SCONJ
ap-1008	135	2	a	a	DET
ap-1008	135	3	state	state	NOUN
ap-1008	135	4	isreached	isreache	VERB
ap-1008	135	5	during	during	ADP
ap-1008	135	6	the	the	DET
ap-1008	135	7	dfa	dfa	PROPN
ap-1008	135	8	run	run	NOUN
ap-1008	135	9	,	,	PUNCT
ap-1008	135	10	whole	whole	ADJ
ap-1008	135	11	segment	segment	NOUN
ap-1008	135	12	around	around	ADP
ap-1008	135	13	the	the	DET
ap-1008	135	14	state	state	NOUN
ap-1008	135	15	is	be	AUX
ap-1008	135	16	loaded	load	VERB
ap-1008	135	17	into	into	ADP
ap-1008	135	18	cpu	cpu	ADJ
ap-1008	135	19	cache	cache	NOUN
ap-1008	135	20	(	(	PUNCT
ap-1008	135	21	from	from	ADP
ap-1008	135	22	main	main	ADJ
ap-1008	135	23	memory	memory	NOUN
ap-1008	135	24	or	or	CCONJ
ap-1008	135	25	hard	hard	ADJ
ap-1008	135	26	disc	disc	NOUN
ap-1008	135	27	drive	drive	NOUN
ap-1008	135	28	)	)	PUNCT
ap-1008	135	29	.	.	PUNCT
ap-1008	136	1	the	the	DET
ap-1008	136	2	decision	decision	NOUN
ap-1008	136	3	which	which	DET
ap-1008	136	4	transition	transition	NOUN
ap-1008	136	5	to	to	PART
ap-1008	136	6	take	take	VERB
ap-1008	136	7	is	be	AUX
ap-1008	136	8	done	do	VERB
ap-1008	136	9	based	base	VERB
ap-1008	136	10	only	only	ADV
ap-1008	136	11	on	on	ADP
ap-1008	136	12	the	the	DET
ap-1008	136	13	information	information	NOUN
ap-1008	136	14	in	in	ADP
ap-1008	136	15	the	the	DET
ap-1008	136	16	segment	segment	NOUN
ap-1008	136	17	(	(	PUNCT
ap-1008	136	18	in	in	ADP
ap-1008	136	19	the	the	DET
ap-1008	136	20	cpu	cpu	NOUN
ap-1008	136	21	cache	cache	NOUN
ap-1008	136	22	)	)	PUNCT
ap-1008	136	23	and	and	CCONJ
ap-1008	136	24	no	no	DET
ap-1008	136	25	other	other	ADJ
ap-1008	136	26	accessesto	accessesto	ADJ
ap-1008	136	27	other	other	ADJ
ap-1008	136	28	segments	segment	NOUN
ap-1008	136	29	(	(	PUNCT
ap-1008	136	30	i.e.	i.e.	X
ap-1008	136	31	,	,	PUNCT
ap-1008	136	32	possible	possible	ADJ
ap-1008	136	33	memory	memory	NOUN
ap-1008	136	34	/	/	SYM
ap-1008	136	35	hdd	hdd	NOUN
ap-1008	136	36	accesses	access	NOUN
ap-1008	136	37	)	)	PUNCT
ap-1008	136	38	are	be	AUX
ap-1008	136	39	needed	need	VERB
ap-1008	136	40	.	.	PUNCT
ap-1008	137	1	while	while	SCONJ
ap-1008	137	2	in	in	ADP
ap-1008	137	3	balík	balík	NOUN
ap-1008	137	4	’s	’s	PART
ap-1008	137	5	implementation	implementation	NOUN
ap-1008	137	6	one	one	NUM
ap-1008	137	7	needs	need	VERB
ap-1008	137	8	to	to	PART
ap-1008	137	9	access	access	VERB
ap-1008	137	10	all	all	DET
ap-1008	137	11	the	the	DET
ap-1008	137	12	destination	destination	NOUN
ap-1008	137	13	states	state	NOUN
ap-1008	137	14	to	to	PART
ap-1008	137	15	retrieve	retrieve	VERB
ap-1008	137	16	the	the	DET
ap-1008	137	17	transition	transition	NOUN
ap-1008	137	18	labels	label	NOUN
ap-1008	137	19	of	of	ADP
ap-1008	137	20	the	the	DET
ap-1008	137	21	corresponding	corresponding	ADJ
ap-1008	137	22	transitions	transition	NOUN
ap-1008	137	23	.	.	PUNCT
ap-1008	138	1	holub	holub	PROPN
ap-1008	138	2	’s	’s	PART
ap-1008	138	3	implementation	implementation	NOUN
ap-1008	138	4	uses	use	VERB
ap-1008	138	5	at	at	ADV
ap-1008	138	6	most	most	ADV
ap-1008	138	7	as	as	ADP
ap-1008	138	8	many	many	ADJ
ap-1008	138	9	main	main	ADJ
ap-1008	138	10	memory	memory	NOUN
ap-1008	138	11	/	/	SYM
ap-1008	138	12	hdd	hdd	NOUN
ap-1008	138	13	accesses	access	NOUN
ap-1008	138	14	as	as	SCONJ
ap-1008	138	15	many	many	ADJ
ap-1008	138	16	states	state	NOUN
ap-1008	138	17	are	be	AUX
ap-1008	138	18	traversed	traverse	VERB
ap-1008	138	19	.	.	PUNCT
ap-1008	139	1	6	6	NUM
ap-1008	139	2	conclusion	conclusion	NOUN
ap-1008	139	3	the	the	DET
ap-1008	139	4	paper	paper	NOUN
ap-1008	139	5	presents	present	VERB
ap-1008	139	6	two	two	NUM
ap-1008	139	7	approaches	approach	NOUN
ap-1008	139	8	to	to	ADP
ap-1008	139	9	dfa	dfa	PROPN
ap-1008	139	10	implementation	implementation	NOUN
ap-1008	139	11	considering	consider	VERB
ap-1008	139	12	cpu	cpu	NOUN
ap-1008	139	13	cache	cache	NOUN
ap-1008	139	14	.	.	PUNCT
ap-1008	140	1	the	the	DET
ap-1008	140	2	first	first	ADJ
ap-1008	140	3	approach	approach	NOUN
ap-1008	140	4	is	be	AUX
ap-1008	140	5	suitable	suitable	ADJ
ap-1008	140	6	for	for	ADP
ap-1008	140	7	dfa	dfa	PROPN
ap-1008	140	8	with	with	ADP
ap-1008	140	9	cycles	cycle	NOUN
ap-1008	140	10	where	where	SCONJ
ap-1008	140	11	we	we	PRON
ap-1008	140	12	expect	expect	VERB
ap-1008	140	13	some	some	DET
ap-1008	140	14	states	state	NOUN
ap-1008	140	15	are	be	AUX
ap-1008	140	16	visited	visit	VERB
ap-1008	140	17	frequently	frequently	ADV
ap-1008	140	18	.	.	PUNCT
ap-1008	141	1	hc	hc	PRON
ap-1008	141	2	and	and	CCONJ
ap-1008	141	3	td	td	NOUN
ap-1008	141	4	implementations	implementation	NOUN
ap-1008	141	5	for	for	ADP
ap-1008	141	6	dfa	dfa	PROPN
ap-1008	141	7	with	with	ADP
ap-1008	141	8	non	non	ADJ
ap-1008	141	9	-	-	ADJ
ap-1008	141	10	sparse	sparse	ADJ
ap-1008	141	11	transition	transition	NOUN
ap-1008	141	12	table	table	NOUN
ap-1008	141	13	were	be	AUX
ap-1008	141	14	discussed	discuss	VERB
ap-1008	141	15	.	.	PUNCT
ap-1008	142	1	on	on	ADP
ap-1008	142	2	the	the	DET
ap-1008	142	3	other	other	ADJ
ap-1008	142	4	hand	hand	NOUN
ap-1008	142	5	the	the	DET
ap-1008	142	6	other	other	ADJ
ap-1008	142	7	approach	approach	NOUN
ap-1008	142	8	is	be	AUX
ap-1008	142	9	suitable	suitable	ADJ
ap-1008	142	10	for	for	ADP
ap-1008	142	11	acyclic	acyclic	ADJ
ap-1008	142	12	dfa	dfa	NOUN
ap-1008	142	13	with	with	ADP
ap-1008	142	14	a	a	DET
ap-1008	142	15	sparse	sparse	ADJ
ap-1008	142	16	transition	transition	NOUN
ap-1008	142	17	table	table	NOUN
ap-1008	142	18	.	.	PUNCT
ap-1008	143	1	this	this	DET
ap-1008	143	2	approach	approach	NOUN
ap-1008	143	3	saves	save	VERB
ap-1008	143	4	memory	memory	NOUN
ap-1008	143	5	used	use	VERB
ap-1008	143	6	but	but	CCONJ
ap-1008	143	7	it	it	PRON
ap-1008	143	8	runs	run	VERB
ap-1008	143	9	slower	slow	ADJ
ap-1008	143	10	than	than	ADP
ap-1008	143	11	the	the	DET
ap-1008	143	12	previous	previous	ADJ
ap-1008	143	13	one	one	NUM
ap-1008	143	14	–	–	PUNCT
ap-1008	143	15	instead	instead	ADV
ap-1008	143	16	of	of	ADP
ap-1008	143	17	direct	direct	ADJ
ap-1008	143	18	transition	transition	NOUN
ap-1008	143	19	table	table	NOUN
ap-1008	143	20	access	access	NOUN
ap-1008	143	21	(	(	PUNCT
ap-1008	143	22	coordinates	coordinate	NOUN
ap-1008	143	23	given	give	VERB
ap-1008	143	24	by	by	ADP
ap-1008	143	25	the	the	DET
ap-1008	143	26	current	current	ADJ
ap-1008	143	27	state	state	NOUN
ap-1008	143	28	and	and	CCONJ
ap-1008	143	29	the	the	DET
ap-1008	143	30	current	current	ADJ
ap-1008	143	31	input	input	NOUN
ap-1008	143	32	symbol	symbol	NOUN
ap-1008	143	33	)	)	PUNCT
ap-1008	143	34	a	a	DET
ap-1008	143	35	linked	link	VERB
ap-1008	143	36	list	list	NOUN
ap-1008	143	37	of	of	ADP
ap-1008	143	38	outgoing	outgoing	ADJ
ap-1008	143	39	transition	transition	NOUN
ap-1008	143	40	of	of	ADP
ap-1008	143	41	a	a	DET
ap-1008	143	42	given	give	VERB
ap-1008	143	43	state	state	NOUN
ap-1008	143	44	is	be	AUX
ap-1008	143	45	linearly	linearly	ADV
ap-1008	143	46	traversed	traverse	VERB
ap-1008	143	47	.	.	PUNCT
ap-1008	144	1	however	however	ADV
ap-1008	144	2	,	,	PUNCT
ap-1008	144	3	reducing	reduce	VERB
ap-1008	144	4	the	the	DET
ap-1008	144	5	memory	memory	NOUN
ap-1008	144	6	used	use	VERB
ap-1008	144	7	for	for	ADP
ap-1008	144	8	the	the	DET
ap-1008	144	9	transition	transition	NOUN
ap-1008	144	10	table	table	NOUN
ap-1008	144	11	increases	increase	VERB
ap-1008	144	12	the	the	DET
ap-1008	144	13	probability	probability	NOUN
ap-1008	144	14	that	that	SCONJ
ap-1008	144	15	the	the	DET
ap-1008	144	16	next	next	ADJ
ap-1008	144	17	state	state	NOUN
ap-1008	144	18	is	be	AUX
ap-1008	144	19	already	already	ADV
ap-1008	144	20	in	in	ADP
ap-1008	144	21	the	the	DET
ap-1008	144	22	cpu	cpu	NOUN
ap-1008	144	23	cache	cache	NOUN
ap-1008	144	24	which	which	PRON
ap-1008	144	25	also	also	ADV
ap-1008	144	26	increases	increase	VERB
ap-1008	144	27	the	the	DET
ap-1008	144	28	speed	speed	NOUN
ap-1008	144	29	of	of	ADP
ap-1008	144	30	dfa	dfa	PROPN
ap-1008	144	31	run	run	NOUN
ap-1008	144	32	.	.	PUNCT
ap-1008	145	1	the	the	DET
ap-1008	145	2	first	first	ADJ
ap-1008	145	3	approach	approach	NOUN
ap-1008	145	4	is	be	AUX
ap-1008	145	5	suitable	suitable	ADJ
ap-1008	145	6	for	for	ADP
ap-1008	145	7	the	the	DET
ap-1008	145	8	dfas	dfas	PROPN
ap-1008	145	9	that	that	PRON
ap-1008	145	10	are	be	AUX
ap-1008	145	11	running	run	VERB
ap-1008	145	12	all	all	DET
ap-1008	145	13	the	the	DET
ap-1008	145	14	time	time	NOUN
ap-1008	145	15	like	like	ADP
ap-1008	145	16	for	for	ADP
ap-1008	145	17	example	example	NOUN
ap-1008	145	18	an	an	DET
ap-1008	145	19	anti	anti	ADJ
ap-1008	145	20	-	-	ADJ
ap-1008	145	21	virus	virus	ADJ
ap-1008	145	22	filter	filter	NOUN
ap-1008	145	23	on	on	ADP
ap-1008	145	24	a	a	DET
ap-1008	145	25	communication	communication	NOUN
ap-1008	145	26	line	line	NOUN
ap-1008	145	27	.	.	PUNCT
ap-1008	146	1	on	on	ADP
ap-1008	146	2	the	the	DET
ap-1008	146	3	other	other	ADJ
ap-1008	146	4	hand	hand	NOUN
ap-1008	146	5	the	the	DET
ap-1008	146	6	second	second	ADJ
ap-1008	146	7	approach	approach	NOUN
ap-1008	146	8	is	be	AUX
ap-1008	146	9	suitable	suitable	ADJ
ap-1008	146	10	for	for	ADP
ap-1008	146	11	a	a	DET
ap-1008	146	12	collection	collection	NOUN
ap-1008	146	13	of	of	ADP
ap-1008	146	14	dfas	dfas	PROPN
ap-1008	146	15	from	from	ADP
ap-1008	146	16	which	which	PRON
ap-1008	146	17	one	one	PRON
ap-1008	146	18	is	be	AUX
ap-1008	146	19	selected	select	VERB
ap-1008	146	20	and	and	CCONJ
ap-1008	146	21	then	then	ADV
ap-1008	146	22	it	it	PRON
ap-1008	146	23	is	be	AUX
ap-1008	146	24	run	run	VERB
ap-1008	146	25	.	.	PUNCT
ap-1008	147	1	that	that	PRON
ap-1008	147	2	is	be	AUX
ap-1008	147	3	for	for	ADP
ap-1008	147	4	example	example	NOUN
ap-1008	147	5	a	a	DET
ap-1008	147	6	case	case	NOUN
ap-1008	147	7	of	of	ADP
ap-1008	147	8	suffix	suffix	ADJ
ap-1008	147	9	or	or	CCONJ
ap-1008	147	10	factor	factor	NOUN
ap-1008	147	11	automata	automata	NOUN
ap-1008	147	12	build	build	VERB
ap-1008	147	13	over	over	ADP
ap-1008	147	14	a	a	DET
ap-1008	147	15	collection	collection	NOUN
ap-1008	147	16	of	of	ADP
ap-1008	147	17	documents	document	NOUN
ap-1008	147	18	stored	store	VERB
ap-1008	147	19	in	in	ADP
ap-1008	147	20	hard	hard	ADJ
ap-1008	147	21	disk	disk	NOUN
ap-1008	147	22	.	.	PUNCT
ap-1008	148	1	the	the	DET
ap-1008	148	2	task	task	NOUN
ap-1008	148	3	is	be	AUX
ap-1008	148	4	then	then	ADV
ap-1008	148	5	for	for	ADP
ap-1008	148	6	a	a	DET
ap-1008	148	7	given	give	VERB
ap-1008	148	8	pattern	pattern	NOUN
ap-1008	148	9	find	find	VERB
ap-1008	148	10	all	all	DET
ap-1008	148	11	documents	document	NOUN
ap-1008	148	12	containing	contain	VERB
ap-1008	148	13	the	the	DET
ap-1008	148	14	pattern	pattern	NOUN
ap-1008	148	15	.	.	PUNCT
ap-1008	149	1	acknowledgment	acknowledgment	NOUN
ap-1008	149	2	this	this	DET
ap-1008	149	3	research	research	NOUN
ap-1008	149	4	has	have	AUX
ap-1008	149	5	been	be	AUX
ap-1008	149	6	partially	partially	ADV
ap-1008	149	7	supported	support	VERB
ap-1008	149	8	by	by	ADP
ap-1008	149	9	the	the	DET
ap-1008	149	10	ministry	ministry	PROPN
ap-1008	149	11	of	of	ADP
ap-1008	149	12	education	education	PROPN
ap-1008	149	13	,	,	PUNCT
ap-1008	149	14	youth	youth	NOUN
ap-1008	149	15	and	and	CCONJ
ap-1008	149	16	sports	sport	NOUN
ap-1008	149	17	under	under	ADP
ap-1008	149	18	research	research	NOUN
ap-1008	149	19	program	program	NOUN
ap-1008	149	20	msm	msm	NOUN
ap-1008	149	21	6840770014	6840770014	NUM
ap-1008	149	22	and	and	CCONJ
ap-1008	149	23	the	the	DET
ap-1008	149	24	czech	czech	PROPN
ap-1008	149	25	science	science	NOUN
ap-1008	149	26	foundation	foundation	PROPN
ap-1008	149	27	as	as	ADP
ap-1008	149	28	project	project	NOUN
ap-1008	149	29	no	no	NOUN
ap-1008	149	30	.	.	PUNCT
ap-1008	150	1	201/06/1039	201/06/1039	NOUN
ap-1008	150	2	.	.	PUNCT
ap-1008	151	1	references	reference	NOUN
ap-1008	151	2	[	[	X
ap-1008	151	3	1	1	NUM
ap-1008	151	4	]	]	X
ap-1008	151	5	aho	aho	NOUN
ap-1008	151	6	,	,	PUNCT
ap-1008	151	7	a.	a.	NOUN
ap-1008	151	8	v.	v.	PROPN
ap-1008	151	9	,	,	PUNCT
ap-1008	151	10	sethi	sethi	PROPN
ap-1008	151	11	,	,	PUNCT
ap-1008	151	12	r.	r.	PROPN
ap-1008	151	13	,	,	PUNCT
ap-1008	151	14	ullman	ullman	PROPN
ap-1008	151	15	,	,	PUNCT
ap-1008	151	16	j.	j.	PROPN
ap-1008	151	17	d.	d.	PROPN
ap-1008	151	18	:	:	PUNCT
ap-1008	151	19	compilers	compiler	NOUN
ap-1008	151	20	–	–	PUNCT
ap-1008	151	21	principles	principle	NOUN
ap-1008	151	22	,	,	PUNCT
ap-1008	151	23	techniques	technique	NOUN
ap-1008	151	24	and	and	CCONJ
ap-1008	151	25	tools	tool	NOUN
ap-1008	151	26	.	.	PUNCT
ap-1008	152	1	addison	addison	PROPN
ap-1008	152	2	-	-	PUNCT
ap-1008	152	3	wesley	wesley	PROPN
ap-1008	152	4	,	,	PUNCT
ap-1008	152	5	reading	reading	NOUN
ap-1008	152	6	,	,	PUNCT
ap-1008	152	7	ma	ma	PROPN
ap-1008	152	8	,	,	PUNCT
ap-1008	152	9	1986	1986	NUM
ap-1008	152	10	.	.	PUNCT
ap-1008	153	1	[	[	X
ap-1008	153	2	2	2	NUM
ap-1008	153	3	]	]	PUNCT
ap-1008	153	4	balík	balík	NOUN
ap-1008	153	5	,	,	PUNCT
ap-1008	153	6	m.	m.	NOUN
ap-1008	153	7	:	:	PUNCT
ap-1008	153	8	dawg	dawg	ADJ
ap-1008	153	9	versus	versus	ADP
ap-1008	153	10	suffix	suffix	PROPN
ap-1008	153	11	array	array	NOUN
ap-1008	153	12	.	.	PUNCT
ap-1008	154	1	in	in	ADP
ap-1008	154	2	:	:	PUNCT
ap-1008	154	3	j.-m	j.-m	NOUN
ap-1008	154	4	.	.	PUNCT
ap-1008	155	1	champarnaud	champarnaud	PROPN
ap-1008	155	2	,	,	PUNCT
ap-1008	155	3	d.	d.	PROPN
ap-1008	155	4	maurel	maurel	PROPN
ap-1008	155	5	(	(	PUNCT
ap-1008	155	6	eds	ed	NOUN
ap-1008	155	7	.	.	PROPN
ap-1008	155	8	):	):	PUNCT
ap-1008	155	9	implementation	implementation	NOUN
ap-1008	155	10	and	and	CCONJ
ap-1008	155	11	application	application	NOUN
ap-1008	155	12	of	of	ADP
ap-1008	155	13	automata	automata	NOUN
ap-1008	155	14	,	,	PUNCT
ap-1008	155	15	number	number	NOUN
ap-1008	155	16	2608	2608	NUM
ap-1008	155	17	in	in	ADP
ap-1008	155	18	lecture	lecture	NOUN
ap-1008	155	19	notes	note	NOUN
ap-1008	155	20	in	in	ADP
ap-1008	155	21	computer	computer	NOUN
ap-1008	155	22	science	science	NOUN
ap-1008	155	23	,	,	PUNCT
ap-1008	155	24	p.	p.	NOUN
ap-1008	155	25	233–238	233–238	NUM
ap-1008	155	26	.	.	PUNCT
ap-1008	156	1	springer	springer	NOUN
ap-1008	156	2	-	-	PUNCT
ap-1008	156	3	verlag	verlag	PROPN
ap-1008	156	4	,	,	PUNCT
ap-1008	156	5	heidelberg	heidelberg	PROPN
ap-1008	156	6	,	,	PUNCT
ap-1008	156	7	2003	2003	NUM
ap-1008	156	8	.	.	PUNCT
ap-1008	157	1	[	[	X
ap-1008	157	2	3	3	NUM
ap-1008	157	3	]	]	X
ap-1008	157	4	blumer	blumer	NOUN
ap-1008	157	5	,	,	PUNCT
ap-1008	157	6	a.	a.	NOUN
ap-1008	157	7	,	,	PUNCT
ap-1008	157	8	blumer	blumer	PROPN
ap-1008	157	9	,	,	PUNCT
ap-1008	157	10	j.	j.	PROPN
ap-1008	157	11	,	,	PUNCT
ap-1008	157	12	ehrenfeucht	ehrenfeucht	PROPN
ap-1008	157	13	,	,	PUNCT
ap-1008	157	14	a.	a.	NOUN
ap-1008	157	15	,	,	PUNCT
ap-1008	157	16	haussler	haussler	NOUN
ap-1008	157	17	,	,	PUNCT
ap-1008	157	18	d.	d.	PROPN
ap-1008	157	19	,	,	PUNCT
ap-1008	157	20	chen	chen	PROPN
ap-1008	157	21	,	,	PUNCT
ap-1008	157	22	m.	m.	NOUN
ap-1008	157	23	t.	t.	PROPN
ap-1008	157	24	,	,	PUNCT
ap-1008	157	25	seiferas	seiferas	PROPN
ap-1008	157	26	,	,	PUNCT
ap-1008	157	27	j.	j.	PROPN
ap-1008	157	28	:	:	PUNCT
ap-1008	157	29	the	the	DET
ap-1008	157	30	smallest	small	ADJ
ap-1008	157	31	automaton	automaton	NOUN
ap-1008	157	32	recognizing	recognize	VERB
ap-1008	157	33	the	the	DET
ap-1008	157	34	subwords	subword	NOUN
ap-1008	157	35	of	of	ADP
ap-1008	157	36	a	a	DET
ap-1008	157	37	text	text	NOUN
ap-1008	157	38	.	.	PUNCT
ap-1008	158	1	theor	theor	PROPN
ap-1008	158	2	.	.	PUNCT
ap-1008	159	1	comput	comput	PROPN
ap-1008	159	2	.	.	PUNCT
ap-1008	160	1	sci	sci	PROPN
ap-1008	160	2	.	.	PROPN
ap-1008	160	3	,	,	PUNCT
ap-1008	160	4	vol	vol	NOUN
ap-1008	160	5	.	.	PROPN
ap-1008	160	6	40	40	NUM
ap-1008	160	7	(	(	PUNCT
ap-1008	160	8	1985	1985	NUM
ap-1008	160	9	)	)	PUNCT
ap-1008	160	10	,	,	PUNCT
ap-1008	160	11	no	no	INTJ
ap-1008	160	12	.	.	NOUN
ap-1008	160	13	1	1	NUM
ap-1008	160	14	,	,	PUNCT
ap-1008	160	15	p.	p.	NOUN
ap-1008	160	16	31–55	31–55	NUM
ap-1008	160	17	.	.	PUNCT
ap-1008	161	1	[	[	X
ap-1008	161	2	4	4	NUM
ap-1008	161	3	]	]	X
ap-1008	161	4	blumer	blumer	NOUN
ap-1008	161	5	,	,	PUNCT
ap-1008	161	6	a.	a.	NOUN
ap-1008	161	7	,	,	PUNCT
ap-1008	161	8	blumer	blumer	PROPN
ap-1008	161	9	,	,	PUNCT
ap-1008	161	10	j.	j.	PROPN
ap-1008	161	11	,	,	PUNCT
ap-1008	161	12	ehrenfeucht	ehrenfeucht	PROPN
ap-1008	161	13	,	,	PUNCT
ap-1008	161	14	a.	a.	NOUN
ap-1008	161	15	,	,	PUNCT
ap-1008	161	16	haussler	haussler	NOUN
ap-1008	161	17	,	,	PUNCT
ap-1008	161	18	d.	d.	PROPN
ap-1008	161	19	,	,	PUNCT
ap-1008	161	20	mcconnel	mcconnel	PROPN
ap-1008	161	21	,	,	PUNCT
ap-1008	161	22	r.	r.	PROPN
ap-1008	161	23	:	:	PUNCT
ap-1008	161	24	complete	complete	ADJ
ap-1008	161	25	inverted	invert	VERB
ap-1008	161	26	files	file	NOUN
ap-1008	161	27	for	for	ADP
ap-1008	161	28	efficient	efficient	ADJ
ap-1008	161	29	text	text	NOUN
ap-1008	161	30	retrieval	retrieval	NOUN
ap-1008	161	31	and	and	CCONJ
ap-1008	161	32	analysis	analysis	NOUN
ap-1008	161	33	.	.	PUNCT
ap-1008	162	1	j.	j.	PROPN
ap-1008	162	2	assoc	assoc	PROPN
ap-1008	162	3	.	.	PUNCT
ap-1008	163	1	comput	comput	PROPN
ap-1008	163	2	.	.	PUNCT
ap-1008	164	1	mach	mach	PROPN
ap-1008	164	2	.	.	PUNCT
ap-1008	164	3	,	,	PUNCT
ap-1008	164	4	vol	vol	NOUN
ap-1008	164	5	.	.	PUNCT
ap-1008	165	1	34	34	NUM
ap-1008	165	2	(	(	PUNCT
ap-1008	165	3	1987	1987	NUM
ap-1008	165	4	)	)	PUNCT
ap-1008	165	5	,	,	PUNCT
ap-1008	166	1	no	no	INTJ
ap-1008	166	2	.	.	NOUN
ap-1008	166	3	3	3	NUM
ap-1008	166	4	,	,	PUNCT
ap-1008	166	5	p.	p.	NOUN
ap-1008	166	6	578–595	578–595	NUM
ap-1008	166	7	.	.	PUNCT
ap-1008	167	1	[	[	X
ap-1008	167	2	5	5	NUM
ap-1008	167	3	]	]	SYM
ap-1008	167	4	champarnaud	champarnaud	ADJ
ap-1008	167	5	,	,	PUNCT
ap-1008	167	6	j.-m	j.-m	NOUN
ap-1008	167	7	.	.	PUNCT
ap-1008	167	8	:	:	PUNCT
ap-1008	168	1	subset	subset	VERB
ap-1008	168	2	construction	construction	NOUN
ap-1008	168	3	complexity	complexity	NOUN
ap-1008	168	4	for	for	ADP
ap-1008	168	5	homogeneous	homogeneous	ADJ
ap-1008	168	6	automata	automata	NOUN
ap-1008	168	7	,	,	PUNCT
ap-1008	168	8	position	position	NOUN
ap-1008	168	9	automata	automata	NOUN
ap-1008	168	10	and	and	CCONJ
ap-1008	168	11	zpc	zpc	NOUN
ap-1008	168	12	-	-	PUNCT
ap-1008	168	13	structures	structure	NOUN
ap-1008	168	14	.	.	PUNCT
ap-1008	169	1	theor	theor	PROPN
ap-1008	169	2	.	.	PUNCT
ap-1008	170	1	comput	comput	PROPN
ap-1008	170	2	.	.	PUNCT
ap-1008	171	1	sci	sci	PROPN
ap-1008	171	2	.	.	PROPN
ap-1008	171	3	,	,	PUNCT
ap-1008	171	4	vol	vol	NOUN
ap-1008	171	5	.	.	PROPN
ap-1008	172	1	267	267	NUM
ap-1008	172	2	(	(	PUNCT
ap-1008	172	3	2001	2001	NUM
ap-1008	172	4	)	)	PUNCT
ap-1008	172	5	,	,	PUNCT
ap-1008	172	6	no	no	INTJ
ap-1008	172	7	.	.	PUNCT
ap-1008	173	1	1–2	1–2	NUM
ap-1008	173	2	,	,	PUNCT
ap-1008	173	3	p.	p.	NOUN
ap-1008	173	4	17–34	17–34	NUM
ap-1008	173	5	.	.	PUNCT
ap-1008	174	1	[	[	X
ap-1008	174	2	6	6	NUM
ap-1008	174	3	]	]	X
ap-1008	174	4	holub	holub	NOUN
ap-1008	174	5	,	,	PUNCT
ap-1008	174	6	j.	j.	PROPN
ap-1008	174	7	:	:	PUNCT
ap-1008	174	8	simulation	simulation	NOUN
ap-1008	174	9	of	of	ADP
ap-1008	174	10	nondeterministic	nondeterministic	ADJ
ap-1008	174	11	finite	finite	ADJ
ap-1008	174	12	automata	automata	NOUN
ap-1008	174	13	in	in	ADP
ap-1008	174	14	pattern	pattern	NOUN
ap-1008	174	15	matching	matching	NOUN
ap-1008	174	16	.	.	PUNCT
ap-1008	175	1	ph.d	ph.d	PROPN
ap-1008	175	2	.	.	PUNCT
ap-1008	176	1	thesis	thesis	NOUN
ap-1008	176	2	,	,	PUNCT
ap-1008	176	3	czech	czech	PROPN
ap-1008	176	4	technical	technical	PROPN
ap-1008	176	5	university	university	PROPN
ap-1008	176	6	in	in	ADP
ap-1008	176	7	prague	prague	PROPN
ap-1008	176	8	,	,	PUNCT
ap-1008	176	9	czech	czech	PROPN
ap-1008	176	10	republic	republic	NOUN
ap-1008	176	11	,	,	PUNCT
ap-1008	176	12	2000	2000	NUM
ap-1008	176	13	.	.	PUNCT
ap-1008	177	1	[	[	X
ap-1008	177	2	7	7	X
ap-1008	177	3	]	]	X
ap-1008	177	4	holub	holub	NOUN
ap-1008	177	5	,	,	PUNCT
ap-1008	177	6	j.	j.	PROPN
ap-1008	177	7	:	:	PUNCT
ap-1008	177	8	bit	bit	NOUN
ap-1008	177	9	parallelism	parallelism	NOUN
ap-1008	177	10	–	–	PUNCT
ap-1008	177	11	nfa	nfa	PROPN
ap-1008	177	12	simulation	simulation	NOUN
ap-1008	177	13	.	.	PUNCT
ap-1008	178	1	in	in	ADP
ap-1008	178	2	:	:	PUNCT
ap-1008	178	3	b.	b.	PROPN
ap-1008	178	4	w.	w.	PROPN
ap-1008	178	5	watson	watson	PROPN
ap-1008	178	6	,	,	PUNCT
ap-1008	178	7	d.	d.	PROPN
ap-1008	178	8	wood	wood	PROPN
ap-1008	178	9	(	(	PUNCT
ap-1008	178	10	eds	ed	NOUN
ap-1008	178	11	.	.	PROPN
ap-1008	178	12	):	):	PUNCT
ap-1008	178	13	implementation	implementation	NOUN
ap-1008	178	14	and	and	CCONJ
ap-1008	178	15	application	application	NOUN
ap-1008	178	16	of	of	ADP
ap-1008	178	17	automata	automata	NOUN
ap-1008	178	18	,	,	PUNCT
ap-1008	178	19	number	number	NOUN
ap-1008	178	20	2494	2494	NUM
ap-1008	178	21	in	in	ADP
ap-1008	178	22	lecture	lecture	NOUN
ap-1008	178	23	notes	note	NOUN
ap-1008	178	24	in	in	ADP
ap-1008	178	25	computer	computer	NOUN
ap-1008	178	26	science	science	NOUN
ap-1008	178	27	,	,	PUNCT
ap-1008	178	28	p.	p.	NOUN
ap-1008	178	29	149–160	149–160	NUM
ap-1008	178	30	.	.	PUNCT
ap-1008	178	31	springer	springer	NOUN
ap-1008	178	32	-	-	PUNCT
ap-1008	178	33	verlag	verlag	PROPN
ap-1008	178	34	,	,	PUNCT
ap-1008	178	35	heidelberg	heidelberg	PROPN
ap-1008	178	36	,	,	PUNCT
ap-1008	178	37	2002	2002	NUM
ap-1008	178	38	.	.	PUNCT
ap-1008	179	1	[	[	X
ap-1008	179	2	8	8	NUM
ap-1008	179	3	]	]	X
ap-1008	179	4	holub	holub	NOUN
ap-1008	179	5	,	,	PUNCT
ap-1008	179	6	j.	j.	PROPN
ap-1008	179	7	:	:	PUNCT
ap-1008	179	8	dynamic	dynamic	ADJ
ap-1008	179	9	programming	programming	NOUN
ap-1008	179	10	—	—	PUNCT
ap-1008	179	11	nfa	nfa	PROPN
ap-1008	179	12	simulation	simulation	NOUN
ap-1008	179	13	.	.	PUNCT
ap-1008	180	1	in	in	ADP
ap-1008	180	2	:	:	PUNCT
ap-1008	180	3	j.-m	j.-m	NOUN
ap-1008	180	4	.	.	PUNCT
ap-1008	181	1	champarnaud	champarnaud	PROPN
ap-1008	181	2	,	,	PUNCT
ap-1008	181	3	d.	d.	PROPN
ap-1008	181	4	maurel	maurel	PROPN
ap-1008	181	5	(	(	PUNCT
ap-1008	181	6	eds	ed	NOUN
ap-1008	181	7	.	.	PROPN
ap-1008	181	8	):	):	PUNCT
ap-1008	181	9	implementation	implementation	NOUN
ap-1008	181	10	and	and	CCONJ
ap-1008	181	11	application	application	NOUN
ap-1008	181	12	of	of	ADP
ap-1008	181	13	automata	automata	NOUN
ap-1008	181	14	,	,	PUNCT
ap-1008	181	15	number	number	NOUN
ap-1008	181	16	2608	2608	NUM
ap-1008	181	17	in	in	ADP
ap-1008	181	18	lecture	lecture	NOUN
ap-1008	181	19	notes	note	NOUN
ap-1008	181	20	in	in	ADP
ap-1008	181	21	computer	computer	NOUN
ap-1008	181	22	science	science	NOUN
ap-1008	181	23	,	,	PUNCT
ap-1008	181	24	p.	p.	NOUN
ap-1008	181	25	295–300	295–300	NUM
ap-1008	181	26	.	.	PUNCT
ap-1008	182	1	springer	springer	NOUN
ap-1008	182	2	-	-	PUNCT
ap-1008	182	3	verlag	verlag	PROPN
ap-1008	182	4	,	,	PUNCT
ap-1008	182	5	heidelberg	heidelberg	PROPN
ap-1008	182	6	,	,	PUNCT
ap-1008	182	7	2003	2003	NUM
ap-1008	182	8	.	.	PUNCT
ap-1008	183	1	[	[	X
ap-1008	183	2	9	9	NUM
ap-1008	183	3	]	]	X
ap-1008	183	4	holub	holub	NOUN
ap-1008	183	5	,	,	PUNCT
ap-1008	183	6	j.	j.	PROPN
ap-1008	183	7	,	,	PUNCT
ap-1008	183	8	crochemore	crochemore	NOUN
ap-1008	183	9	,	,	PUNCT
ap-1008	183	10	m.	m.	NOUN
ap-1008	183	11	:	:	PUNCT
ap-1008	183	12	on	on	ADP
ap-1008	183	13	the	the	DET
ap-1008	183	14	implementation	implementation	NOUN
ap-1008	183	15	of	of	ADP
ap-1008	183	16	compact	compact	ADJ
ap-1008	183	17	dawg	dawg	NOUN
ap-1008	183	18	’s	’s	NOUN
ap-1008	183	19	.	.	PUNCT
ap-1008	184	1	in	in	ADP
ap-1008	184	2	:	:	PUNCT
ap-1008	184	3	j.-m	j.-m	NOUN
ap-1008	184	4	.	.	PUNCT
ap-1008	185	1	champarnaud	champarnaud	PROPN
ap-1008	185	2	,	,	PUNCT
ap-1008	185	3	d.	d.	PROPN
ap-1008	185	4	maurel	maurel	PROPN
ap-1008	185	5	(	(	PUNCT
ap-1008	185	6	eds	ed	NOUN
ap-1008	185	7	.	.	PROPN
ap-1008	185	8	):	):	PUNCT
ap-1008	185	9	implementation	implementation	NOUN
ap-1008	185	10	and	and	CCONJ
ap-1008	185	11	application	application	NOUN
ap-1008	185	12	of	of	ADP
ap-1008	185	13	automata	automata	NOUN
ap-1008	185	14	,	,	PUNCT
ap-1008	185	15	number	number	NOUN
ap-1008	185	16	2608	2608	NUM
ap-1008	185	17	in	in	ADP
ap-1008	185	18	lecture	lecture	NOUN
ap-1008	185	19	notes	note	NOUN
ap-1008	185	20	in	in	ADP
ap-1008	185	21	computer	computer	NOUN
ap-1008	185	22	science	science	NOUN
ap-1008	185	23	,	,	PUNCT
ap-1008	185	24	p.	p.	NOUN
ap-1008	185	25	289–294	289–294	NUM
ap-1008	185	26	.	.	PUNCT
ap-1008	186	1	springer	springer	NOUN
ap-1008	186	2	-	-	PUNCT
ap-1008	186	3	verlag	verlag	PROPN
ap-1008	186	4	,	,	PUNCT
ap-1008	186	5	heidelberg	heidelberg	PROPN
ap-1008	186	6	,	,	PUNCT
ap-1008	186	7	2003	2003	NUM
ap-1008	186	8	.	.	PUNCT
ap-1008	187	1	54	54	NUM
ap-1008	187	2	©	©	PROPN
ap-1008	187	3	czech	czech	PROPN
ap-1008	187	4	technical	technical	PROPN
ap-1008	187	5	university	university	PROPN
ap-1008	187	6	publishing	publishing	NOUN
ap-1008	187	7	house	house	NOUN
ap-1008	187	8	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-1008	187	9	acta	acta	PROPN
ap-1008	187	10	polytechnica	polytechnica	PROPN
ap-1008	187	11	vol	vol	NOUN
ap-1008	187	12	.	.	PUNCT
ap-1008	188	1	47	47	NUM
ap-1008	188	2	no	no	NOUN
ap-1008	188	3	.	.	PUNCT
ap-1008	189	1	6/2007	6/2007	NUM
ap-1008	189	2	2	2	NUM
ap-1008	189	3	b	b	SYM
ap-1008	189	4	3	3	NUM
ap-1008	189	5	c	c	NOUN
ap-1008	189	6	4	4	NUM
ap-1008	189	7	d	d	NOUN
ap-1008	189	8	0	0	NUM
ap-1008	190	1	a	a	DET
ap-1008	190	2	d	d	X
ap-1008	190	3	dc0	dc0	NOUN
ap-1008	190	4	10	10	NUM
ap-1008	190	5	0	0	NUM
ap-1008	190	6	0	0	NUM
ap-1008	190	7	1state	1state	NUM
ap-1008	190	8	number	number	NOUN
ap-1008	190	9	:	:	PUNCT
ap-1008	190	10	bitstream	bitstream	NOUN
ap-1008	190	11	:	:	PUNCT
ap-1008	190	12	fig	fig	NOUN
ap-1008	190	13	.	.	PUNCT
ap-1008	191	1	5	5	NUM
ap-1008	191	2	:	:	PUNCT
ap-1008	191	3	a	a	DET
ap-1008	191	4	sketch	sketch	NOUN
ap-1008	191	5	of	of	ADP
ap-1008	191	6	bitstream	bitstream	NOUN
ap-1008	191	7	implementation	implementation	NOUN
ap-1008	191	8	of	of	ADP
ap-1008	191	9	dfa	dfa	PROPN
ap-1008	191	10	from	from	ADP
ap-1008	191	11	fig	fig	NOUN
ap-1008	191	12	.	.	PUNCT
ap-1008	192	1	2	2	NUM
ap-1008	193	1	[	[	SYM
ap-1008	193	2	10	10	NUM
ap-1008	193	3	]	]	X
ap-1008	193	4	holub	holub	NOUN
ap-1008	193	5	,	,	PUNCT
ap-1008	193	6	j.	j.	PROPN
ap-1008	193	7	,	,	PUNCT
ap-1008	193	8	iliopoulos	iliopoulos	PROPN
ap-1008	193	9	,	,	PUNCT
ap-1008	193	10	c.	c.	PROPN
ap-1008	193	11	s.	s.	PROPN
ap-1008	193	12	,	,	PUNCT
ap-1008	193	13	melichar	melichar	PROPN
ap-1008	193	14	,	,	PUNCT
ap-1008	193	15	b.	b.	PROPN
ap-1008	193	16	,	,	PUNCT
ap-1008	193	17	mouchard	mouchard	PROPN
ap-1008	193	18	,	,	PUNCT
ap-1008	193	19	l.	l.	PROPN
ap-1008	193	20	:	:	PUNCT
ap-1008	193	21	distributed	distribute	VERB
ap-1008	193	22	string	string	NOUN
ap-1008	193	23	matching	matching	NOUN
ap-1008	193	24	using	use	VERB
ap-1008	193	25	finite	finite	ADJ
ap-1008	193	26	automata	automata	NOUN
ap-1008	193	27	.	.	PUNCT
ap-1008	194	1	in	in	ADP
ap-1008	194	2	:	:	PUNCT
ap-1008	194	3	r.	r.	PROPN
ap-1008	194	4	raman	raman	PROPN
ap-1008	194	5	,	,	PUNCT
ap-1008	194	6	j.	j.	PROPN
ap-1008	194	7	simpson	simpson	PROPN
ap-1008	194	8	(	(	PUNCT
ap-1008	194	9	eds	eds	PROPN
ap-1008	194	10	.	.	PUNCT
ap-1008	194	11	):	):	PUNCT
ap-1008	194	12	proceedings	proceeding	NOUN
ap-1008	194	13	of	of	ADP
ap-1008	194	14	the	the	DET
ap-1008	194	15	10th	10th	ADJ
ap-1008	194	16	australasian	australasian	ADJ
ap-1008	194	17	workshop	workshop	NOUN
ap-1008	194	18	on	on	ADP
ap-1008	194	19	combinatorial	combinatorial	ADJ
ap-1008	194	20	algorithms	algorithm	NOUN
ap-1008	194	21	,	,	PUNCT
ap-1008	194	22	p.	p.	NOUN
ap-1008	194	23	114–128	114–128	NUM
ap-1008	194	24	,	,	PUNCT
ap-1008	194	25	perth	perth	PROPN
ap-1008	194	26	,	,	PUNCT
ap-1008	194	27	wa	wa	NOUN
ap-1008	194	28	,	,	PUNCT
ap-1008	194	29	australia	australia	PROPN
ap-1008	194	30	,	,	PUNCT
ap-1008	194	31	1999	1999	NUM
ap-1008	194	32	.	.	PUNCT
ap-1008	195	1	[	[	X
ap-1008	195	2	11	11	NUM
ap-1008	195	3	]	]	X
ap-1008	195	4	holub	holub	NOUN
ap-1008	195	5	,	,	PUNCT
ap-1008	195	6	j.	j.	PROPN
ap-1008	195	7	,	,	PUNCT
ap-1008	195	8	špiller	špiller	NOUN
ap-1008	195	9	,	,	PUNCT
ap-1008	195	10	p.	p.	NOUN
ap-1008	195	11	:	:	PUNCT
ap-1008	195	12	practical	practical	ADJ
ap-1008	195	13	experiments	experiment	NOUN
ap-1008	195	14	with	with	ADP
ap-1008	195	15	nfa	nfa	PROPN
ap-1008	195	16	simulation	simulation	NOUN
ap-1008	195	17	.	.	PUNCT
ap-1008	196	1	in	in	ADP
ap-1008	196	2	:	:	PUNCT
ap-1008	196	3	l.	l.	PROPN
ap-1008	196	4	cleophas	cleophas	PROPN
ap-1008	196	5	,	,	PUNCT
ap-1008	196	6	b.	b.	PROPN
ap-1008	196	7	w.	w.	PROPN
ap-1008	196	8	watson	watson	PROPN
ap-1008	196	9	(	(	PUNCT
ap-1008	196	10	eds	eds	PROPN
ap-1008	196	11	.	.	PROPN
ap-1008	196	12	):	):	PUNCT
ap-1008	196	13	proceedings	proceeding	NOUN
ap-1008	196	14	of	of	ADP
ap-1008	196	15	the	the	DET
ap-1008	196	16	eindhoven	eindhoven	ADJ
ap-1008	196	17	fastar	fastar	NOUN
ap-1008	196	18	days	day	NOUN
ap-1008	196	19	2004	2004	NUM
ap-1008	196	20	,	,	PUNCT
ap-1008	196	21	tu	tu	PROPN
ap-1008	196	22	eindhoven	eindhoven	PROPN
ap-1008	196	23	,	,	PUNCT
ap-1008	196	24	the	the	DET
ap-1008	196	25	netherlands	netherlands	PROPN
ap-1008	196	26	,	,	PUNCT
ap-1008	196	27	2004	2004	NUM
ap-1008	196	28	,	,	PUNCT
ap-1008	196	29	p.	p.	NOUN
ap-1008	196	30	73–95	73–95	NUM
ap-1008	196	31	.	.	PUNCT
ap-1008	197	1	[	[	X
ap-1008	197	2	12	12	NUM
ap-1008	197	3	]	]	X
ap-1008	197	4	huffman	huffman	PROPN
ap-1008	197	5	,	,	PUNCT
ap-1008	197	6	d.	d.	PROPN
ap-1008	197	7	a.	a.	PROPN
ap-1008	197	8	:	:	PUNCT
ap-1008	197	9	the	the	DET
ap-1008	197	10	synthesis	synthesis	NOUN
ap-1008	197	11	of	of	ADP
ap-1008	197	12	sequential	sequential	ADJ
ap-1008	197	13	switching	switch	VERB
ap-1008	197	14	circuits	circuit	NOUN
ap-1008	197	15	.	.	PUNCT
ap-1008	198	1	j.	j.	PROPN
ap-1008	198	2	franklin	franklin	PROPN
ap-1008	198	3	institute	institute	PROPN
ap-1008	198	4	,	,	PUNCT
ap-1008	198	5	vol	vol	NOUN
ap-1008	198	6	.	.	PROPN
ap-1008	199	1	257	257	NUM
ap-1008	199	2	(	(	PUNCT
ap-1008	199	3	1954	1954	NUM
ap-1008	199	4	)	)	PUNCT
ap-1008	199	5	,	,	PUNCT
ap-1008	199	6	p.	p.	NOUN
ap-1008	199	7	161–190	161–190	NUM
ap-1008	199	8	,	,	PUNCT
ap-1008	199	9	275–303	275–303	NUM
ap-1008	199	10	.	.	PUNCT
ap-1008	200	1	[	[	X
ap-1008	200	2	13	13	NUM
ap-1008	200	3	]	]	X
ap-1008	200	4	kleene	kleene	NOUN
ap-1008	200	5	,	,	PUNCT
ap-1008	200	6	s.	s.	PROPN
ap-1008	200	7	c.	c.	PROPN
ap-1008	200	8	:	:	PUNCT
ap-1008	200	9	representation	representation	NOUN
ap-1008	200	10	of	of	ADP
ap-1008	200	11	events	event	NOUN
ap-1008	200	12	in	in	ADP
ap-1008	200	13	nerve	nerve	NOUN
ap-1008	200	14	nets	net	NOUN
ap-1008	200	15	and	and	CCONJ
ap-1008	200	16	finite	finite	ADJ
ap-1008	200	17	automata	automata	NOUN
ap-1008	200	18	.	.	PUNCT
ap-1008	201	1	automata	automata	PROPN
ap-1008	201	2	studies	study	NOUN
ap-1008	201	3	,	,	PUNCT
ap-1008	201	4	(	(	PUNCT
ap-1008	201	5	1956	1956	NUM
ap-1008	201	6	)	)	PUNCT
ap-1008	201	7	,	,	PUNCT
ap-1008	201	8	p.	p.	PROPN
ap-1008	201	9	3–42	3–42	PROPN
ap-1008	201	10	.	.	PUNCT
ap-1008	202	1	[	[	X
ap-1008	202	2	14	14	NUM
ap-1008	202	3	]	]	X
ap-1008	202	4	mcculloch	mcculloch	PROPN
ap-1008	202	5	,	,	PUNCT
ap-1008	202	6	w.	w.	PROPN
ap-1008	202	7	s.	s.	PROPN
ap-1008	202	8	,	,	PUNCT
ap-1008	202	9	pitts	pitts	PROPN
ap-1008	202	10	,	,	PUNCT
ap-1008	202	11	w.	w.	PROPN
ap-1008	202	12	:	:	PUNCT
ap-1008	202	13	a	a	DET
ap-1008	202	14	logical	logical	ADJ
ap-1008	202	15	calculus	calculus	NOUN
ap-1008	202	16	of	of	ADP
ap-1008	202	17	the	the	DET
ap-1008	202	18	ideas	idea	NOUN
ap-1008	202	19	immanent	immanent	ADJ
ap-1008	202	20	in	in	ADP
ap-1008	202	21	nervous	nervous	ADJ
ap-1008	202	22	activity	activity	NOUN
ap-1008	202	23	.	.	PUNCT
ap-1008	203	1	bull	bull	NOUN
ap-1008	203	2	.	.	PUNCT
ap-1008	204	1	math	math	NOUN
ap-1008	204	2	.	.	PUNCT
ap-1008	205	1	biophysics	biophysic	NOUN
ap-1008	205	2	,	,	PUNCT
ap-1008	205	3	vol	vol	NOUN
ap-1008	205	4	.	.	PROPN
ap-1008	205	5	5	5	NUM
ap-1008	205	6	(	(	PUNCT
ap-1008	205	7	1943	1943	NUM
ap-1008	205	8	)	)	PUNCT
ap-1008	205	9	,	,	PUNCT
ap-1008	205	10	p.	p.	NOUN
ap-1008	205	11	115–133	115–133	NUM
ap-1008	205	12	.	.	PUNCT
ap-1008	206	1	[	[	X
ap-1008	206	2	15	15	NUM
ap-1008	206	3	]	]	X
ap-1008	206	4	mealy	mealy	PROPN
ap-1008	206	5	,	,	PUNCT
ap-1008	206	6	g.	g.	PROPN
ap-1008	206	7	h.	h.	PROPN
ap-1008	206	8	:	:	PUNCT
ap-1008	206	9	a	a	DET
ap-1008	206	10	method	method	NOUN
ap-1008	206	11	for	for	ADP
ap-1008	206	12	synthetizing	synthetize	VERB
ap-1008	206	13	sequential	sequential	ADJ
ap-1008	206	14	circuits	circuit	NOUN
ap-1008	206	15	.	.	PUNCT
ap-1008	207	1	bell	bell	NOUN
ap-1008	207	2	system	system	PROPN
ap-1008	207	3	technical	technical	PROPN
ap-1008	207	4	j.	j.	PROPN
ap-1008	207	5	,	,	PUNCT
ap-1008	207	6	vol	vol	NOUN
ap-1008	207	7	.	.	PROPN
ap-1008	207	8	34	34	NUM
ap-1008	207	9	(	(	PUNCT
ap-1008	207	10	1955	1955	NUM
ap-1008	207	11	)	)	PUNCT
ap-1008	207	12	,	,	PUNCT
ap-1008	207	13	no	no	INTJ
ap-1008	207	14	.	.	NOUN
ap-1008	207	15	5	5	NUM
ap-1008	207	16	,	,	PUNCT
ap-1008	207	17	p.	p.	NOUN
ap-1008	207	18	1045–1079	1045–1079	NUM
ap-1008	207	19	.	.	PUNCT
ap-1008	208	1	[	[	X
ap-1008	208	2	16	16	NUM
ap-1008	208	3	]	]	X
ap-1008	208	4	melichar	melichar	PROPN
ap-1008	208	5	,	,	PUNCT
ap-1008	208	6	b.	b.	PROPN
ap-1008	208	7	:	:	PUNCT
ap-1008	208	8	approximate	approximate	ADJ
ap-1008	208	9	string	string	NOUN
ap-1008	208	10	matching	matching	NOUN
ap-1008	208	11	by	by	ADP
ap-1008	208	12	finite	finite	ADJ
ap-1008	208	13	automata	automata	NOUN
ap-1008	208	14	.	.	PUNCT
ap-1008	209	1	in	in	ADP
ap-1008	209	2	:	:	PUNCT
ap-1008	209	3	v.	v.	ADP
ap-1008	209	4	hlaváč	hlaváč	PROPN
ap-1008	209	5	,	,	PUNCT
ap-1008	209	6	r.	r.	PROPN
ap-1008	209	7	šára	šára	PROPN
ap-1008	209	8	(	(	PUNCT
ap-1008	209	9	eds	ed	NOUN
ap-1008	209	10	.	.	PUNCT
ap-1008	209	11	):	):	PUNCT
ap-1008	209	12	computer	computer	NOUN
ap-1008	209	13	analysis	analysis	NOUN
ap-1008	209	14	of	of	ADP
ap-1008	209	15	images	image	NOUN
ap-1008	209	16	and	and	CCONJ
ap-1008	209	17	patterns	pattern	NOUN
ap-1008	209	18	,	,	PUNCT
ap-1008	209	19	number	number	NOUN
ap-1008	209	20	970	970	NUM
ap-1008	209	21	in	in	ADP
ap-1008	209	22	lecture	lecture	NOUN
ap-1008	209	23	notes	note	NOUN
ap-1008	209	24	in	in	ADP
ap-1008	209	25	computer	computer	NOUN
ap-1008	209	26	science	science	NOUN
ap-1008	209	27	,	,	PUNCT
ap-1008	209	28	p.	p.	NOUN
ap-1008	209	29	342–349	342–349	NUM
ap-1008	209	30	.	.	PUNCT
ap-1008	209	31	springer	springer	NOUN
ap-1008	209	32	-	-	PUNCT
ap-1008	209	33	verlag	verlag	PROPN
ap-1008	209	34	,	,	PUNCT
ap-1008	209	35	berlin	berlin	PROPN
ap-1008	209	36	,	,	PUNCT
ap-1008	209	37	1995	1995	NUM
ap-1008	209	38	.	.	PUNCT
ap-1008	210	1	[	[	X
ap-1008	210	2	17	17	NUM
ap-1008	210	3	]	]	X
ap-1008	210	4	moore	moore	PROPN
ap-1008	210	5	,	,	PUNCT
ap-1008	210	6	e.	e.	PROPN
ap-1008	210	7	f.	f.	PROPN
ap-1008	210	8	:	:	PUNCT
ap-1008	210	9	gedanken	gedanken	NOUN
ap-1008	210	10	experiments	experiment	NOUN
ap-1008	210	11	on	on	ADP
ap-1008	210	12	sequential	sequential	ADJ
ap-1008	210	13	machines	machine	NOUN
ap-1008	210	14	.	.	PUNCT
ap-1008	211	1	automata	automata	PROPN
ap-1008	211	2	studies	study	NOUN
ap-1008	211	3	,	,	PUNCT
ap-1008	211	4	1956	1956	NUM
ap-1008	211	5	,	,	PUNCT
ap-1008	211	6	p.	p.	NOUN
ap-1008	211	7	129–153	129–153	NUM
ap-1008	211	8	.	.	PUNCT
ap-1008	212	1	[	[	X
ap-1008	212	2	18	18	NUM
ap-1008	212	3	]	]	X
ap-1008	212	4	ngassam	ngassam	PROPN
ap-1008	212	5	,	,	PUNCT
ap-1008	212	6	e.	e.	PROPN
ap-1008	212	7	k.	k.	PROPN
ap-1008	212	8	:	:	PUNCT
ap-1008	212	9	towards	towards	ADP
ap-1008	212	10	cache	cache	PROPN
ap-1008	212	11	optimization	optimization	NOUN
ap-1008	212	12	in	in	ADP
ap-1008	212	13	finite	finite	ADJ
ap-1008	212	14	automata	automata	NOUN
ap-1008	212	15	implementations	implementation	NOUN
ap-1008	212	16	.	.	PUNCT
ap-1008	213	1	ph.d	ph.d	PROPN
ap-1008	213	2	.	.	PUNCT
ap-1008	214	1	thesis	thesis	NOUN
ap-1008	214	2	,	,	PUNCT
ap-1008	214	3	university	university	NOUN
ap-1008	214	4	of	of	ADP
ap-1008	214	5	pretoria	pretoria	PROPN
ap-1008	214	6	,	,	PUNCT
ap-1008	214	7	south	south	PROPN
ap-1008	214	8	africa	africa	PROPN
ap-1008	214	9	,	,	PUNCT
ap-1008	214	10	2006	2006	NUM
ap-1008	214	11	.	.	PUNCT
ap-1008	215	1	[	[	X
ap-1008	215	2	19	19	NUM
ap-1008	215	3	]	]	SYM
ap-1008	215	4	ngassam	ngassam	PROPN
ap-1008	215	5	,	,	PUNCT
ap-1008	215	6	e.	e.	PROPN
ap-1008	215	7	k.	k.	PROPN
ap-1008	215	8	,	,	PUNCT
ap-1008	215	9	kourie	kourie	PROPN
ap-1008	215	10	,	,	PUNCT
ap-1008	215	11	d.	d.	PROPN
ap-1008	215	12	g.	g.	PROPN
ap-1008	215	13	,	,	PUNCT
ap-1008	215	14	watson	watson	PROPN
ap-1008	215	15	,	,	PUNCT
ap-1008	215	16	b.	b.	PROPN
ap-1008	215	17	w.	w.	PROPN
ap-1008	215	18	:	:	PUNCT
ap-1008	215	19	reordering	reorder	VERB
ap-1008	215	20	finite	finite	PROPN
ap-1008	215	21	automatata	automatata	PROPN
ap-1008	215	22	states	state	NOUN
ap-1008	215	23	for	for	ADP
ap-1008	215	24	fast	fast	ADJ
ap-1008	215	25	string	string	NOUN
ap-1008	215	26	recognition	recognition	NOUN
ap-1008	215	27	.	.	PUNCT
ap-1008	216	1	in	in	ADP
ap-1008	216	2	:	:	PUNCT
ap-1008	216	3	j.	j.	PROPN
ap-1008	216	4	holub	holub	PROPN
ap-1008	216	5	,	,	PUNCT
ap-1008	216	6	m.	m.	NOUN
ap-1008	216	7	šimánek	šimánek	ADJ
ap-1008	216	8	(	(	PUNCT
ap-1008	216	9	eds	ed	NOUN
ap-1008	216	10	.	.	PROPN
ap-1008	216	11	):	):	PUNCT
ap-1008	216	12	proceedings	proceeding	NOUN
ap-1008	216	13	of	of	ADP
ap-1008	216	14	the	the	DET
ap-1008	216	15	prague	prague	PROPN
ap-1008	216	16	stringology	stringology	PROPN
ap-1008	216	17	conference	conference	PROPN
ap-1008	216	18	’	'	PUNCT
ap-1008	216	19	05	05	NUM
ap-1008	216	20	,	,	PUNCT
ap-1008	216	21	czech	czech	PROPN
ap-1008	216	22	technical	technical	PROPN
ap-1008	216	23	university	university	PROPN
ap-1008	216	24	in	in	ADP
ap-1008	216	25	prague	prague	PROPN
ap-1008	216	26	,	,	PUNCT
ap-1008	216	27	czech	czech	PROPN
ap-1008	216	28	republic	republic	NOUN
ap-1008	216	29	,	,	PUNCT
ap-1008	216	30	2005	2005	NUM
ap-1008	216	31	,	,	PUNCT
ap-1008	216	32	p.	p.	NOUN
ap-1008	216	33	69–80	69–80	NUM
ap-1008	216	34	.	.	PUNCT
ap-1008	217	1	[	[	X
ap-1008	217	2	20	20	NUM
ap-1008	217	3	]	]	SYM
ap-1008	217	4	ngassam	ngassam	PROPN
ap-1008	217	5	,	,	PUNCT
ap-1008	217	6	e.	e.	PROPN
ap-1008	217	7	k.	k.	PROPN
ap-1008	217	8	,	,	PUNCT
ap-1008	217	9	kourie	kourie	PROPN
ap-1008	217	10	,	,	PUNCT
ap-1008	217	11	d.	d.	PROPN
ap-1008	217	12	g.	g.	PROPN
ap-1008	217	13	,	,	PUNCT
ap-1008	217	14	watson	watson	PROPN
ap-1008	217	15	,	,	PUNCT
ap-1008	217	16	b.	b.	PROPN
ap-1008	217	17	w.	w.	PROPN
ap-1008	217	18	:	:	PUNCT
ap-1008	217	19	on	on	ADP
ap-1008	217	20	implementation	implementation	NOUN
ap-1008	217	21	and	and	CCONJ
ap-1008	217	22	performance	performance	NOUN
ap-1008	217	23	of	of	ADP
ap-1008	217	24	table	table	NOUN
ap-1008	217	25	-	-	PUNCT
ap-1008	217	26	driven	drive	VERB
ap-1008	217	27	dfa	dfa	NOUN
ap-1008	217	28	-	-	PUNCT
ap-1008	217	29	based	base	VERB
ap-1008	217	30	string	string	NOUN
ap-1008	217	31	processors	processor	NOUN
ap-1008	217	32	.	.	PUNCT
ap-1008	218	1	in	in	ADP
ap-1008	218	2	:	:	PUNCT
ap-1008	218	3	j.	j.	PROPN
ap-1008	218	4	holub	holub	PROPN
ap-1008	218	5	,	,	PUNCT
ap-1008	218	6	j.	j.	PROPN
ap-1008	218	7	ž	ž	PROPN
ap-1008	218	8	�	�	PROPN
ap-1008	218	9	árek	árek	PROPN
ap-1008	218	10	(	(	PUNCT
ap-1008	218	11	eds	ed	NOUN
ap-1008	218	12	.	.	PUNCT
ap-1008	218	13	):	):	PUNCT
ap-1008	218	14	proceedings	proceeding	NOUN
ap-1008	218	15	of	of	ADP
ap-1008	218	16	the	the	DET
ap-1008	218	17	prague	prague	PROPN
ap-1008	218	18	stringology	stringology	PROPN
ap-1008	218	19	conference	conference	PROPN
ap-1008	218	20	’	'	PUNCT
ap-1008	218	21	06	06	NUM
ap-1008	218	22	,	,	PUNCT
ap-1008	218	23	czech	czech	PROPN
ap-1008	218	24	technical	technical	PROPN
ap-1008	218	25	university	university	PROPN
ap-1008	218	26	in	in	ADP
ap-1008	218	27	prague	prague	PROPN
ap-1008	218	28	,	,	PUNCT
ap-1008	218	29	czech	czech	PROPN
ap-1008	218	30	republic	republic	NOUN
ap-1008	218	31	,	,	PUNCT
ap-1008	218	32	2006	2006	NUM
ap-1008	218	33	,	,	PUNCT
ap-1008	218	34	p.	p.	NOUN
ap-1008	218	35	108–122	108–122	NUM
ap-1008	218	36	.	.	PUNCT
ap-1008	219	1	[	[	X
ap-1008	219	2	21	21	NUM
ap-1008	219	3	]	]	X
ap-1008	219	4	rabin	rabin	PROPN
ap-1008	219	5	,	,	PUNCT
ap-1008	219	6	m.	m.	NOUN
ap-1008	219	7	o.	o.	PROPN
ap-1008	219	8	,	,	PUNCT
ap-1008	219	9	scott	scott	PROPN
ap-1008	219	10	,	,	PUNCT
ap-1008	219	11	d.	d.	PROPN
ap-1008	219	12	:	:	PUNCT
ap-1008	219	13	finite	finite	PROPN
ap-1008	219	14	automata	automata	NOUN
ap-1008	219	15	and	and	CCONJ
ap-1008	219	16	their	their	PRON
ap-1008	219	17	decision	decision	NOUN
ap-1008	219	18	problems	problem	NOUN
ap-1008	219	19	.	.	PUNCT
ap-1008	220	1	ibm	ibm	PROPN
ap-1008	220	2	j.	j.	PROPN
ap-1008	220	3	res	res	PROPN
ap-1008	220	4	.	.	PUNCT
ap-1008	221	1	dev	dev	PROPN
ap-1008	221	2	.	.	PROPN
ap-1008	221	3	,	,	PUNCT
ap-1008	221	4	vol	vol	NOUN
ap-1008	221	5	.	.	PROPN
ap-1008	221	6	3	3	NUM
ap-1008	221	7	(	(	PUNCT
ap-1008	221	8	1959	1959	NUM
ap-1008	221	9	)	)	PUNCT
ap-1008	221	10	,	,	PUNCT
ap-1008	221	11	p.	p.	NOUN
ap-1008	221	12	114–125	114–125	NUM
ap-1008	221	13	.	.	PUNCT
ap-1008	222	1	[	[	X
ap-1008	222	2	22	22	NUM
ap-1008	222	3	]	]	X
ap-1008	222	4	thompson	thompson	PROPN
ap-1008	222	5	,	,	PUNCT
ap-1008	222	6	k.	k.	PROPN
ap-1008	222	7	:	:	PUNCT
ap-1008	222	8	regular	regular	ADJ
ap-1008	222	9	expression	expression	NOUN
ap-1008	222	10	search	search	NOUN
ap-1008	222	11	algorithm	algorithm	NOUN
ap-1008	222	12	.	.	PUNCT
ap-1008	223	1	commun	commun	PROPN
ap-1008	223	2	.	.	PUNCT
ap-1008	224	1	assoc	assoc	PROPN
ap-1008	224	2	.	.	PUNCT
ap-1008	225	1	comput	comput	PROPN
ap-1008	225	2	.	.	PUNCT
ap-1008	226	1	mach	mach	PROPN
ap-1008	226	2	.	.	PUNCT
ap-1008	226	3	,	,	PUNCT
ap-1008	226	4	vol	vol	NOUN
ap-1008	226	5	.	.	PROPN
ap-1008	226	6	11	11	NUM
ap-1008	226	7	(	(	PUNCT
ap-1008	226	8	1968	1968	NUM
ap-1008	226	9	)	)	PUNCT
ap-1008	226	10	,	,	PUNCT
ap-1008	226	11	p.	p.	NOUN
ap-1008	227	1	419–422	419–422	NUM
ap-1008	227	2	.	.	PUNCT
ap-1008	228	1	ing	ing	PROPN
ap-1008	228	2	.	.	PUNCT
ap-1008	229	1	jan	jan	PROPN
ap-1008	229	2	holub	holub	PROPN
ap-1008	229	3	,	,	PUNCT
ap-1008	229	4	ph.d	ph.d	PROPN
ap-1008	229	5	.	.	PUNCT
ap-1008	230	1	e	e	X
ap-1008	230	2	-	-	NOUN
ap-1008	230	3	mail	mail	NOUN
ap-1008	230	4	:	:	PUNCT
ap-1008	230	5	holub@fel.cvut.cz	holub@fel.cvut.cz	PROPN
ap-1008	230	6	department	department	PROPN
ap-1008	230	7	of	of	ADP
ap-1008	230	8	computer	computer	NOUN
ap-1008	230	9	science	science	NOUN
ap-1008	230	10	and	and	CCONJ
ap-1008	230	11	engineering	engineering	NOUN
ap-1008	230	12	czech	czech	PROPN
ap-1008	230	13	technical	technical	PROPN
ap-1008	230	14	university	university	PROPN
ap-1008	230	15	in	in	ADP
ap-1008	230	16	prague	prague	PROPN
ap-1008	230	17	faculty	faculty	NOUN
ap-1008	230	18	of	of	ADP
ap-1008	230	19	electrical	electrical	ADJ
ap-1008	230	20	engineering	engineering	NOUN
ap-1008	230	21	karlovo	karlovo	PROPN
ap-1008	230	22	nám	nám	PROPN
ap-1008	230	23	.	.	PUNCT
ap-1008	231	1	13	13	NUM
ap-1008	231	2	121	121	NUM
ap-1008	231	3	35	35	NUM
ap-1008	231	4	prague	prague	NOUN
ap-1008	231	5	2	2	NUM
ap-1008	231	6	,	,	PUNCT
ap-1008	231	7	czech	czech	PROPN
ap-1008	231	8	republic	republic	NOUN
ap-1008	231	9	©	©	PROPN
ap-1008	231	10	czech	czech	PROPN
ap-1008	231	11	technical	technical	PROPN
ap-1008	231	12	university	university	PROPN
ap-1008	231	13	publishing	publishing	NOUN
ap-1008	231	14	house	house	NOUN
ap-1008	231	15	http://ctn.cvut.cz/ap/	http://ctn.cvut.cz/ap/	PROPN
ap-1008	231	16	55	55	NUM
ap-1008	231	17	acta	acta	PROPN
ap-1008	231	18	polytechnica	polytechnica	PROPN
ap-1008	231	19	vol	vol	NOUN
ap-1008	231	20	.	.	PUNCT
ap-1008	232	1	47	47	NUM
ap-1008	232	2	no	no	NOUN
ap-1008	232	3	.	.	PUNCT
ap-1008	233	1	6/2007	6/2007	NUM