Inference for transition network grammars

Authors:
S. M. Chou;K. S. Fu
Affiliations:
School of Electrical Engineering, Purdue University, W. Lafayette, IN 47907, U.S.A.;School of Electrical Engineering, Purdue University, W. Lafayette, IN 47907, U.S.A.
Venue:
Computer Languages
Year:
1979

Derivatives of Regular Expressions

Journal of the ACM (JACM)
The use of grammatical inference for designing programming languages

Communications of the ACM
Transition network grammars for natural language analysis

Communications of the ACM
Formal languages and their relation to automata

Formal languages and their relation to automata
Reduction of enumeration in grammar acquisition

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
An augmented state transition network analysis procedure

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence

Hi-index	0.00

This paper gives a brief introduction to transition networks and proposes an approach to the inference of transition network grammars.