@article{Gorshkov:1990aa,
    Abstract = {A new subclass of deterministic context-free languages with a decidable inclusion problem is described in terms of finite automata on the direct product of free semigroups. The decidability proof exploits the structural properties of the automata.},
    Author = {Gorshkov, P. V. and Stavrovskii, A. B.},
    File = {A subclass of deterministic context-free languages with a decidable inclusion problem - Gorshkov-Stavrovskii1990\_Article\_ASubclassOfDeterministicContex - a - v.pdf},
    ISBN = {1573-8337},
    Journal = {Cybernetics},
    Number = {2},
    Pages = {156--162},
    Title = {A subclass of deterministic context-free languages with a decidable inclusion problem},
    URL = {https://doi.org/10.1007/BF01068604},
    Volume = {26},
    Year = {1990},
    bdsk-url-1 = {https://doi.org/10.1007/BF01068604},
    da = {1990/03/01},
    date-added = {2020-05-08 10:24:27 +0200},
    date-modified = {2020-05-08 10:24:27 +0200},
    id = {Gorshkov1990},
    ty = {JOUR},
    doi = {10.1007/BF01068604}
}

@article{Gorshkov:1990aa, Abstract = {A new subclass of deterministic context-free languages with a decidable inclusion problem is described in terms of finite automata on the direct product of free semigroups. The decidability proof exploits the structural properties of the automata.}, Author = {Gorshkov, P. V. and Stavrovskii, A. B.}, File = {A subclass of deterministic context-free languages with a decidable inclusion problem - Gorshkov-Stavrovskii1990_Article_ASubclassOfDeterministicContex - a - v.pdf}, ISBN = {1573-8337}, Journal = {Cybernetics}, Number = {2}, Pages = {156--162}, Title = {A subclass of deterministic context-free languages with a decidable inclusion problem}, URL = {https://doi.org/10.1007/BF01068604}, Volume = {26}, Year = {1990}, bdsk-url-1 = {https://doi.org/10.1007/BF01068604}, da = {1990/03/01}, date-added = {2020-05-08 10:24:27 +0200}, date-modified = {2020-05-08 10:24:27 +0200}, id = {Gorshkov1990}, ty = {JOUR}, doi = {10.1007/BF01068604} }