A finite state probabilistic automaton that accepts a context sensitive language that is not context free
Kuo An Chen,Ming-Kuei Hu +1 more
TLDR
A finite state probabilistic automaton existed that would accept a context sensitive language that is not context free and this automaton is constructed.Abstract:
It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed.read more
Citations
More filters
Journal ArticleDOI
Probabilistic automata push-down
Zhi-Zhong Chen,Takumi Kasai +1 more
TL;DR: Kolmogorov complexity is used in the proof of the major theorem and the class of acceptable languages depends to some extent on the cut-point, in the case of a one-sided PPDA, which means there exists an infinite hierarchy.
References
More filters
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Proceedings ArticleDOI
Delayed-logic and finite-state machines
TL;DR: The paper's main results hinge on certain properties of a new type of state subgraph, and on an indirect application of permutation groups to the state-pair transition problem.
Journal ArticleDOI
On stochastic automata and languages
King-Sun Fu,Timothy J. Li +1 more
TL;DR: A flexible stochastic experimental procedure based on Chebyshev's inequality is proposed for the λ-stochastic languages and the class of maximum-likelihood Stochastic languages is defined on the basis of the maximum- likelihood final-state distribution.