@article{IBARRA201630,
    Abstract = {Bounded context-free languages have been investigated for nearly fifty years, yet they continue to generate interest as seen from recent studies. Here, we present a number of results about bounded context-free languages. First we give a new (simpler) proof that every context-free language L⊆w1⁎w2⁎{\ldots}wn⁎ can be accepted by a PDA with at most 2n−3 reversals. We also introduce new collections of bounded context-free languages and present some of their interesting properties. Some of the properties are counter-intuitive and may point to some deeper facts about bounded CFLs. We present some results about semilinear sets and also present a generalization of the well-known result that over a one-letter alphabet, the families of context-free and regular languages coincide.},
    Author = {Ibarra, Oscar H. and Ravikumar, Bala},
    File = {On bounded languages and reversal-bounded automata - 1-s2.0-S0890540115001182-main - a.pdf},
    ISSN = {0890-5401},
    Journal = {Information and Computation},
    Keywords = {Context-free language (CFL), Nondeterministic pushdown automaton (PDA), Reversal-bounded, Semilinear set, Stratified linear set},
    Note = {7th International Conference on Language and Automata Theory and Applications (LATA 2013)},
    Pages = {30-42},
    Title = {On bounded languages and reversal-bounded automata},
    URL = {https://www.sciencedirect.com/science/article/pii/S0890540115001182},
    Volume = {246},
    Year = {2016},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540115001182},
    bdsk-url-2 = {https://doi.org/10.1016/j.ic.2015.11.007},
    date-added = {2023-01-07 09:31:25 +0100},
    date-modified = {2023-01-07 09:31:25 +0100},
    doi = {10.1016/j.ic.2015.11.007}
}

@article{IBARRA201630, Abstract = {Bounded context-free languages have been investigated for nearly fifty years, yet they continue to generate interest as seen from recent studies. Here, we present a number of results about bounded context-free languages. First we give a new (simpler) proof that every context-free language L⊆w1⁎w2⁎{\ldots}wn⁎ can be accepted by a PDA with at most 2n−3 reversals. We also introduce new collections of bounded context-free languages and present some of their interesting properties. Some of the properties are counter-intuitive and may point to some deeper facts about bounded CFLs. We present some results about semilinear sets and also present a generalization of the well-known result that over a one-letter alphabet, the families of context-free and regular languages coincide.}, Author = {Ibarra, Oscar H. and Ravikumar, Bala}, File = {On bounded languages and reversal-bounded automata - 1-s2.0-S0890540115001182-main - a.pdf}, ISSN = {0890-5401}, Journal = {Information and Computation}, Keywords = {Context-free language (CFL), Nondeterministic pushdown automaton (PDA), Reversal-bounded, Semilinear set, Stratified linear set}, Note = {7th International Conference on Language and Automata Theory and Applications (LATA 2013)}, Pages = {30-42}, Title = {On bounded languages and reversal-bounded automata}, URL = {https://www.sciencedirect.com/science/article/pii/S0890540115001182}, Volume = {246}, Year = {2016}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0890540115001182}, bdsk-url-2 = {https://doi.org/10.1016/j.ic.2015.11.007}, date-added = {2023-01-07 09:31:25 +0100}, date-modified = {2023-01-07 09:31:25 +0100}, doi = {10.1016/j.ic.2015.11.007} }