String Suffix Automata and Subtree Pushdown Automata

String suffix automata accept all suffixes of a given string and belong to the fundamental stringology principles. Extending their transitions by specific pushdown operations results in new subtree pushdown automata, which accept all subtrees of a given subject tree in prefix notation and are analogous to the suffix automata in their properties. The deterministic subtree pushdown automaton accepts an input subtree in time linear to the number of nodes of the subtree and its total size is linear to the number of nodes of the given subject tree.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[3]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[4]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[5]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[6]  Borivoj Melichar,et al.  On regular tree languages and deterministic pushdown automata , 2009, Acta Informatica.

[7]  Wojciech Rytter,et al.  Jewels of stringology , 2002 .

[8]  William F. Smyth,et al.  Computing Patterns in Strings , 2003 .