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

Concise representations of regular languages by degree and probabilistic finite automata

โœ Scribed by Chandra M. R. Kintala; Kong -Yee Pun; Detlef Wotschke

Publisher
Springer
Year
1993
Tongue
English
Weight
744 KB
Volume
26
Category
Article
ISSN
1433-0490

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