PROBABILISTIC AND WEIGHTED GRAMMARS

被引：54

作者：

SALOMAA, A

机构：

[1] Mathematics Department, University of Turku

来源：

INFORMATION AND CONTROL | 1969年 / 15卷 / 06期

关键词：

D O I：

10.1016/S0019-9958(69)90554-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Devices for the generation of languages, corresponding to the probabilistic recognition devices or probabilistic automata, are introduced and the resulting families of languages are investigated. Comparisons are made with some other recently introduced grammars, where restrictions are imposed not only on the form of the rewriting rules but also on the use of them. A uniform representation for such grammars is provided by the notion of a grammar with a prescribed control language for the derivations. © 1970 Academic Press, Inc.

引用

页码：529 / &

共 8 条

[1]

Abraham S., 1965, COMPUT LINGUIST, V4, P61

[2] GRAMMARS WITH PARTIAL ORDERING OF RULES [J].

FRIS, I .

INFORMATION AND CONTROL, 1968, 12 (5-6) :415-&

[3]

Ginsburg S., 1968, Mathematical Systems Theory, V2, P159, DOI 10.1007/BF01692513

[4] PROGRAMMED GRAMMARS AND CLASSES OF FORMAL LANGUAGES [J].

ROSENKRANTZ, DJ .

JOURNAL OF THE ACM, 1969, 16 (01) :107-+

[5] ON FINITE AUTOMATA WITH A TIME-VARIANT STRUCTURE [J].

SALOMAA, A .

INFORMATION AND CONTROL, 1968, 13 (02) :85-&

[6]

SALOMAA A, 1969, THEORY AUTOMATA

[7] GENERALIZED AUTOMATA AND STOCHASTIC LANGUAGES [J].

TURAKAINEN, P .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 21 (02) :303-+

[8]

TURAKAINEN P, 1969, ANN ACAD SCI FENN A1, P439

← 1 →