Показать сокращенную информацию
dc.contributor.author | Nasyrov I. | |
dc.date.accessioned | 2018-09-14T20:13:37Z | |
dc.date.available | 2018-09-14T20:13:37Z | |
dc.date.issued | 1989 | |
dc.identifier.issn | 0232-0274 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/132243 | |
dc.description.abstract | Two measures of nondeterminism are introduced and used for classification of context-free languages (CFLs). Three families of CFLs covering the whole set of CFLs are considered. | |
dc.relation.ispartofseries | Computers and Artificial Intelligence | |
dc.title | Measures of nondeterminism for pushdown automata | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 1 | |
dc.relation.ispartofseries-volume | 8 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 43 | |
dc.source.id | SCOPUS02320274-1989-8-1-SID0024901314 |