๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comparative complexity of the representation of languages by probabilistic automata

โœ Scribed by F. M. Ablaev

Publisher
Springer US
Year
1990
Tongue
English
Weight
537 KB
Volume
25
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Succinct representation of regular langu
Succinct representation of regular languages by boolean automata
โœ Ernst Leiss ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 346 KB

Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B

Logical Complexity of Some Classes of Tr
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata
โœ Wojciech Buszkowski ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ