ON AN APPROACH OF MODELING OF CONTEXT-FREE GRAMMARS BY NONDETERMINISTIC FINITE AUTOMATA

  • Marina Anatolievna Zubova

Abstract

This article provides examples of the transformation of context-free grammars in the objects of a new formalism, which is a special extension of the class of nondeterministic finite automata. The objects of this formalism can define all the possible context-free languages.
Section
Technical Sciences