Contents

Ars Combinatoria

  • Research article

Semi-Deterministic Virtual Finite Automaton\((SDVFA)\) of order \((s, t)\) and Regular Grammar

A. Jain1
132, Uttranchal 5, LP. Extension Delhi India
  • Published: 31/07/2014

Abstract

In this paper, we establish the equivalence between semi-
deterministic virtual finite automaton\((SDVFA)\) of order \((s,t)\) and
and regular grammar.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
A. Jain. Semi-Deterministic Virtual Finite Automaton\((SDVFA)\) of order \((s, t)\) and Regular Grammar[J], Ars Combinatoria, Volume 115. 187-196. .