Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them

1 January 1980

journal article
Published by SAGE Publications in Fundamenta Informaticae

Vol. 3 (1) , 65-75
https://doi.org/10.3233/fi-1980-3106

Abstract

The paper deals with a class of programs called deterministic Mazurkiewicz algorithms. It considers languages associated with such algorithms by using symbols instead of actual relations and concatenation of words rather than composition of actual relations. It is shown that the class of languages so generated is precisely the class of simple context-free languages of Korenjak and Hoperoft [8].

Keywords

DETERMINISTIC MAZURKIEWICZ
SYMBOLS
CONCATENATION
WORDS
MAZURKIEWICZ ALGORITHMS
ALGORITHMS AND LANGUAGES
REMARKS ON DETERMINISTIC

This publication has 0 references indexed in Scilit: