|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tatiana Generalova,Boris Melnikov,Alexey Vylitok
Pág. 1 - 8
In this paper, a new formalism for specification of context-free languages is proposed. In this formalism, the application of an auxiliary alphabet and the imposition of additional conditions make it possible to obtain an extension of the class of n...
ver más
|
|
|
|
|
|