2 papers
cs.FL2024
Global One-Counter Tree Automata
Luisa Herrmann, Richard Mörbitz
We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographi…
cs.FL2023
Constituency Parsing as an Instance of the M-monoid Parsing Problem
Richard Mörbitz
We consider the constituent parsing problem which states: given a final state normalized constituent tree automaton (CTA) and a string, compute the set of all constituent trees tha…