@article{Shankar:Regularity:DPDA:TCS:1991,
    Address = {Essex, UK},
    Author = {Shankar, Priti and Adiga, B. S.},
    File = {A Graph-based Regularity Test for Deterministic Context-free Languages - Shankar, Adiga (0) (0) - a - a - c.pdf},
    ISSN = {0304-3975},
    Journal = {Theor. Comput. Sci.},
    Keywords = {regularity problem and deterministic context-free languages},
    Month = {October},
    Number = {1},
    Pages = {117--125},
    Publisher = {Elsevier Science Publishers Ltd.},
    Title = {A Graph-based Regularity Test for Deterministic Context-free Languages},
    URL = {http://dx.doi.org/10.1016/0304-3975(91)90076-E},
    Volume = {88},
    Year = {1991},
    acmid = {127030},
    bdsk-url-1 = {http://dx.doi.org/10.1016/0304-3975(91)90076-E},
    date-added = {2016-01-22 11:50:14 +0000},
    date-modified = {2019-06-18 10:51:03 +0200},
    issue_date = {Sept. 30, 1991},
    numpages = {9},
    doi = {10.1016/0304-3975(91)90076-E}
}

@article{Shankar:Regularity:DPDA:TCS:1991, Address = {Essex, UK}, Author = {Shankar, Priti and Adiga, B. S.}, File = {A Graph-based Regularity Test for Deterministic Context-free Languages - Shankar, Adiga (0) (0) - a - a - c.pdf}, ISSN = {0304-3975}, Journal = {Theor. Comput. Sci.}, Keywords = {regularity problem and deterministic context-free languages}, Month = {October}, Number = {1}, Pages = {117--125}, Publisher = {Elsevier Science Publishers Ltd.}, Title = {A Graph-based Regularity Test for Deterministic Context-free Languages}, URL = {http://dx.doi.org/10.1016/0304-3975(91)90076-E}, Volume = {88}, Year = {1991}, acmid = {127030}, bdsk-url-1 = {http://dx.doi.org/10.1016/0304-3975(91)90076-E}, date-added = {2016-01-22 11:50:14 +0000}, date-modified = {2019-06-18 10:51:03 +0200}, issue_date = {Sept. 30, 1991}, numpages = {9}, doi = {10.1016/0304-3975(91)90076-E} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge