Open AccessA Method to Convert Regular Expression into Non-Deterministic Finite Automata
Author(s) -
Abhishek Singh
Publication year - 2019
Publication title -
international journal of applied science and engineering
Language(s) - English
Resource type - Journals
eISSN - 2322-0465
pISSN - 2321-0745
DOI - 10.30954/2322-0465.2.2019.3
Subject(s) - regular expression , nondeterministic finite automaton , expression (computer science) , deterministic finite automaton , dfa minimization , finite state machine , automaton , computer science , mathematics , theoretical computer science , algorithm , automata theory , programming language