Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kaur, Deepinder
- Dual Finite Automata to Scan Regular Languages
Abstract Views :100 |
PDF Views:2
Authors
Affiliations
1 IET, Bhaddal, Ropar, IN
2 Govt. College, Ropar, IN
3 DWIET, Mohali, IN
1 IET, Bhaddal, Ropar, IN
2 Govt. College, Ropar, IN
3 DWIET, Mohali, IN
Source
Research Cell: An International Journal of Engineering Sciences, Vol 4 (2011), Pagination: 283-288Abstract
A regular language is generally accepted by a single finite automaton. But when to increase the efficiency, we use Dual Finite Automata, An input string is scanned by two deterministic finite automata (DFA's): reading from the string's head and tail respectively. One of them accepts the regular language itself; the other accepts the language's reversal. Whether a string is accepted depends on the states of both automata, when their reading heads meet. Dual finite automata can be applied in compiler generation and parallel computing.- Collision Avoidance and Energy Optimization by Clustering in WSN
Abstract Views :137 |
PDF Views:4
Authors
Affiliations
1 Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, IN
1 Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, IN