论文信息 - Probabilistic Grammars and Automata

Probabilistic Grammars and Automata

A mathematical formulation of probabilistic grammars, as well as the random languages generated by probabilistic grammars, is introduced. Various types of probabilistic grammars are considered. The relations between these grammars and the corresponding types of probabilistic automata are examined.

Eugene S. Santos

[1] Eugene S. Santos,et al. Probabilistic Turing machines and computability , 1969 .

[2] G. H. Matthews. A Note on Assymmetry in Phrase Structure Grammars , 1964, Inf. Control..

[3] Eugene S. Santos,et al. Computability by probabilistic Turing machines , 1971 .

[4] Dana S. Scott. Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[5] Arto Salomaa,et al. Probabilistic and Weighted Grammars , 1969, Inf. Control..

[6] Helmut Thiele,et al. On Asynchronous Stochastic Automata , 1970, Inf. Control..