ABSTRACTION AND ENCAPSULATION AND METHOD PARAMETRISED BASED AUTOMETA

abstratc automata will make by the complete all psiible states of n states automata without shares information by any but here the state that is multiple n times of state with arrow of all ttype signaling arrow of all type from on satte to another state then we shortede and live automata to get from it to reduce state in the abstarct autometa states encaplsulate automata:-> encapsualte automata in it data hidng automate in it based automat with nth satte will cretae and it hides th details from the nth states automata it hide th state fro currenet state of nthe automata or past state of of automata mupltipel inheritence automata there will be multipel inherteice automat from base automat to child autoata method based paarmetrised automata:-> method based parametrized automata in it automata state and automata passed as an argument in methdo satte because method will ave state in this methdo state automats will passed then by paremeter it chnange the state of the automata

Comments

Popular posts from this blog

neutron mathmatics

NEW TYPE OF TRAIN

Language Mining and Mining fuel lanague compiler or data compiler not we will say gene (DNA)and self internet measns fuel internet ( its a secret project of our hiring not hiring we cant say currently but we are eager for this project opening we have but research and approch):approach and research