Further Remarks on Reduced Languages

Article type: Research Article

Authors: Paun, Gheorghe^a | Szijarto, Miklos^b | Vicolov, Sorina^c

Affiliations: [a] Institute of Mathematics, Str. Academiei 14, 70109 Bucuresti, Romania | [b] Istvan Szechenyi College of Technology, Sagvari E. u.3, Gyor, Hungary | [c] Faculty of Mathematics, University of Bucharest, Str. Academici 14, 70109 Bucuresli, Romania

Abstract: Union, homomorphic and inverse homomorphic representations of languages are obtained, starting from reduced languages introduced in earlier formal language approaches to parallel program schemes. The reduced-ness decidability is also investigated (it is decidable for regular and undecidable for linear languages).

DOI: 10.3233/FI-1992-163-407

Journal: Fundamenta Informaticae, vol. 16, no. 3-4, pp. 337-347, 1992