Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/9846
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Crvenković S. | en_US |
dc.contributor.author | Madarász Rozália | en_US |
dc.date.accessioned | 2020-03-03T14:35:22Z | - |
dc.date.available | 2020-03-03T14:35:22Z | - |
dc.date.issued | 1993-02-01 | - |
dc.identifier.issn | 03043975 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/9846 | - |
dc.description.abstract | In 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.ispartof | Theoretical Computer Science | en |
dc.title | On Kleen algebras | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/0304-3975(93)90228-L | - |
dc.identifier.scopus | 2-s2.0-0002192457 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0002192457 | - |
dc.description.version | Published | en_US |
dc.relation.lastpage | 24 | en |
dc.relation.firstpage | 17 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 108 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | https://orcid.org/0000-0001-5115-6943 | - |
crisitem.author.orcid | 0000-0001-5115-6943 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
11
checked on Sep 9, 2023
Page view(s)
19
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.