Measures of nondeterminism for pushdown automata

Authors
Publication date
1 January 1989
Publisher

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

    Similar works

    Full text

    thumbnail-image

    Available Versions

    Kazan Federal University Digital Repository

    redirect
    oaioai:dspace.kpfu.ru:net/132243
    Last time updated on 07/05/2019