On N-Algebraic Parikh Slender Power Series

dc.creatorHonkala,Juha
dc.date1997
dc.date.accessioned2024-02-06T12:49:06Z
dc.date.available2024-02-06T12:49:06Z
dc.descriptionIn a recent paper we introduced Parikh slender languages and series as a generalization of slender languages defined and studied by Andrasiu, Dassow, Paun and Salomaa. Results concerning Parikh slender series can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given N-algebraic series is Parikh slender.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-003-10-1114
dc.identifierhttps://lib.jucs.org/article/27416/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7235
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 3(10): 1114-1120
dc.titleOn N-Algebraic Parikh Slender Power Series
dc.typeResearch Article
Файлы
Коллекции