On Languages Defined by Linear Probabilistic Automata

Abstract

The class of mod-p linear probabilistic automata are defined. It is shown that rood-2 linear probabilistic automata driven by a single binomial process define regular languages for all cut-points, and that mod-3 linear probabilistic automata driven by a single trinomial process may define nonregular languages. It is also shown that mod-2 linear… (More)
DOI: 10.1016/S0019-9958(70)90254-8

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics