Algebraic characterization of IF-automata

N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the present work, we have introduced the concept of layers of IF-automaton, provide the characterization of algebraic concepts of an IF-automaton from its layer point of view, and investigate relationship between IF-automata and upper semilattices. We also confer a decomposition of an IF-automaton and investigate a method of formation of an IF-automaton for a given finite poset. Interestingly, we have demonstrated that there exists an isomorphism between an upper semilattice and the poset of class of subautomata of an IF-automaton.

Cite

CITATION STYLE

APA

Yadav, V. K., Yadav, S., Dubey, M. K., & Tiwari, S. P. (2019). Algebraic characterization of IF-automata. In Advances in Intelligent Systems and Computing (Vol. 714, pp. 565–575). Springer Verlag. https://doi.org/10.1007/978-981-13-0224-4_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free