On the linear computational complexity of the parser for quasi-context sensitive languages

2000
journal article
article
12
cris.lastimport.scopus2024-04-07T17:51:20Z
cris.lastimport.wos2024-04-10T00:25:07Z
dc.affiliationWydział Zarządzania i Komunikacji Społecznejpl
dc.contributor.authorJurek, Janusz - 128557 pl
dc.date.accessioned2018-10-10T09:15:58Z
dc.date.available2018-10-10T09:15:58Z
dc.date.issued2000pl
dc.description.number2pl
dc.description.physical179-187pl
dc.description.volume21pl
dc.identifier.doi10.1016/S0167-8655(99)00145-2pl
dc.identifier.eissn1872-7344pl
dc.identifier.issn0167-8655pl
dc.identifier.projectROD UJ / Opl
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/57759
dc.languageengpl
dc.language.containerengpl
dc.rightsDodaję tylko opis bibliograficzny*
dc.rights.licencebez licencji
dc.rights.uri*
dc.subject.ensyntactic pattern recognitionpl
dc.subject.enparsingpl
dc.subject.encontext sensitive languagespl
dc.subject.enprogrammed grammarspl
dc.subtypeArticlepl
dc.titleOn the linear computational complexity of the parser for quasi-context sensitive languagespl
dc.title.journalPattern Recognition Letterspl
dc.typeJournalArticlepl
dspace.entity.typePublication
Affiliations

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
0
Views per month

No access

No Thumbnail Available