... O(n3g2t 2) recognition algorithm for a head
automaton grammar H in which every Ha is
g-split. For deterministic automata, the run-
time is O(n3g2t) a considerable improvement
on the O(n3g3t 2) ... O(n 4) results for the natural formalism
of bilexical context-free grammar, and for AI-
shawi's (1996) head automaton grammars. For
the usual case, split head automaton gr...
... for Scientific Research (NWO) under project
number 22 0-80-001. De Rijke was also supported
by grants from NWO, under project numbers 365-
20 -005, 6 12. 069.006, 6 12. 000.106, 6 12. 000 .20 7,
and 6 12. 066.3 02.
References
S. ... Left
NumEdges 26 8 328 20 519 16473
NumStates 12 15 844 755
Table 1: Automata sizes for the “One-Automaton”
case, with alpha = 0.0001.
we selected alpha...