EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
2003 ◽
Vol 14
(06)
◽
pp. 1103-1116
◽
Keyword(s):
Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. This paper studies efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton, and also proposes a number of techniques of reducing the size of these automata.
2009 ◽
Vol 2009
◽
pp. 1-10
◽
2009 ◽
Vol 20
(04)
◽
pp. 669-684
◽
1999 ◽
Vol 72
(4)
◽
pp. 415-431
◽
Keyword(s):