Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/9846
DC FieldValueLanguage
dc.contributor.authorCrvenković S.en_US
dc.contributor.authorMadarász Rozáliaen_US
dc.date.accessioned2020-03-03T14:35:22Z-
dc.date.available2020-03-03T14:35:22Z-
dc.date.issued1993-02-01-
dc.identifier.issn03043975en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/9846-
dc.description.abstractIn this paper we prove that the class of inversion-free Kleene algebras is not finitely based. The main idea is to use a result of Redko and Salomaa for regular languages. We also prove unsolvability of the word problem for Kleene algebras and some other varieties of algebras. © 1993.en
dc.relation.ispartofTheoretical Computer Scienceen
dc.titleOn Kleen algebrasen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1016/0304-3975(93)90228-L-
dc.identifier.scopus2-s2.0-0002192457-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0002192457-
dc.description.versionPublisheden_US
dc.relation.lastpage24en
dc.relation.firstpage17en
dc.relation.issue1en
dc.relation.volume108en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.orcidhttps://orcid.org/0000-0001-5115-6943-
crisitem.author.orcid0000-0001-5115-6943-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

11
checked on Sep 9, 2023

Page view(s)

19
Last Week
7
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.