Homomorphic images and shuffle product on probabilistic automata
by J. Arockia Jeyakumar; T. Rajaretnam
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 7, No. 1, 2019

Abstract: A probabilistic automaton (pa) is a fuzzy automaton, in which, sum of all fuzzy memberships of the initial states is one and from each state, on an input symbol, the sum of the fuzzy memberships of the transitions is one. In pa, it is shown that, if h : Γ^* → Σ^* is a morphism and h^–1 (λ) = λ, then the image of a recognisable subset of Γ^* is a recognisable subset of Σ^* and if h is fine, then the inverse image of recognisable subset of Σ^* is recognisable. It is also proved that the shuffle product of any two recognisable sets is recognisable.

Online publication date: Mon, 10-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com