Abstract
An automaton is used where information and materials are transformed, transmitted, and utilized for performing some processes without direct involvement of human. A finite automaton (both deterministic and non-deterministic) is used to recognize a formal regular language. In this paper, we will represent the acceptance of a formal regular language (Type 3 according to Noam Chomsky) by both deterministic and non-deterministic automaton. We are using a simple algorithm to implement finite-state automaton in a middle-level language and demonstrate that deterministic finite-state automation provides a best and unique solution in comparison to non-deterministic finite-state automaton. More important that if a problem solved by Non-deterministic finite state automation can be easily solved using equivalent deterministic finite state automaton.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call