peer reviewed journals, call for paper languages, ugc approved science journal
The Internet has become a daily necessity to utmost of the effective participants in which we interact and communicate among ourselves by switching data and information sensed about the environment and atmosphere. From this IoT they relate autonomously to the real world events and offer us with services with or without direct human interference. In this project we use IoT for energy efficient Environmental Conditions recognizing and supervising in our Classroom. This gives a vast advantage on the smart Classroom systems using Internet of Things. This project will help the teacher present in the classroom to allow them to control the classroom using android application in the Android smartphone. The overall system design is mainly based on Arduino Mega 2560. The appliances are to be controlled by the Android Application. The android application is developed using Blynk software or Blynk android application. We can supervise the state of sensors connected in the Arduino board and we can control the modules by simply enabling some options in the android application in our smart phone.
open access journal of engineering, call for paper physics, ugc approved journals for computer science, indexed journal
In automata theory a minimization is the task of transforming a given finite state machine into an equivalent automation that has a minimum number of states. Here, the reduction of Deterministic Finite Automata(DFA) is very simple whereas Nondeterministic Finite Automata(NFA) is complex because which has maximium number of possible paths to reach new states. So a minimal NFA is a primal problem in automata theory. We consider the problem of approximating a minimal NFA or a minimal regular expression. There are several approaches to NFA minimization either without approximation guarantees or running in at least exponential time. Here this paper introducing the new NFA reduction algorithm for the minimization of NFA. This algorithm will reduce number of state transitions of Nondeterministic Finite Automata. NFA reduction algorithm also resolves the complexity of Kameda- Weiner algorithm. This paper shown empirically that this algorithm is effective in largely reducing the memory requirement of NFA minimization algorithm. Reducing the size of NFA by using NFA Reduction Algorithm has been shown to reduce importantly the search time.
