Equivalence of \(SDVFA\) of order \((s, t)\) with \(DFA, VDFA, NFA\) and \(\epsilon\)-NFA

Abstract

The notion of \(SDVFA\) (Strong Deterministic Variable Finite Automaton) of order \((s,t)\) was previously introduced by the author \([12]\). In this paper, we demonstrate the equivalence of \(SDVFA\) of order \((s,t)\) with DFA (Deterministic Finite Automaton), \(VDPA\) (Variable Deterministic Pushdown Automaton), NFA (Nondeterministic Finite Automaton), and \(\epsilon\)-NFA (extended Nondeterministic Finite Automaton). This equivalence is established by presenting conversions between \(SDVFA\) and \(DFA, VDFA, NFA\) (\(\epsilon\)-NFA), and vice versa.