id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ap-1113	Flouri, T.	On Tree Pattern Matching by Pushdown Automata	2009	6	.pdf	application/pdf	5807	301	66	� � �� � � � � �� (2) � � � � � �� 3 A Deterministic Pushdown Automaton accepting trees in prefix notation The prefix notation of a tree can be generated by a gram- mar G N T P S� ( , , , ), having rules P of the following form: (1)S a� 0 (2)S a S� 1 (3)S a SS� 2 … (n)S a Sn n � � � 1 1 30 © Czech Technical University Publishing House http://ctn.cvut.cz/ap/ Acta Polytechnica Vol. 49 No. 2–3/2009 Since the grammar is LR(0), belonging to the subclass of context-free grammars named as deterministic context free grammars, the generated language belongs to the class of de- terministic context-free languages and can be recognised by a de- terministic pushdown automaton.	cache/ap-1113.pdf	txt/ap-1113.txt