Paper Info
Title
String Suffix Automata And Subtree Pushdown Automata
Abstract
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.
Year
Venue
Keywords
2009
PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009
tree, subtree, string suffix automata, tree pattern matching, pushdown automata
Field
DocType
Citations 
Deterministic context-free grammar,Embedded pushdown automaton,Discrete mathematics,Context-free language,Nested word,Suffix,Computer science,Automaton,Deterministic pushdown automaton,Pushdown automaton
Conference
9
PageRank 
References 
Authors
0.83
0
1
Name
Order
Citations
PageRank
Jan Janousek1234.80