@article{LANDWEBER1963131,
Abstract = {It is shown that the class of languages generated by type 1 phrase structure grammars is not enlarged by allowing end markers, that this class is closed under the operation of intersection, and that those languages representable by linear bounded automata belong to this class.},
Author = {Landweber, Peter S.},
File = {1-s2.0-S0019995863901694-main (0) (0) - a - a - e.pdf},
ISSN = {0019-9958},
Journal = {Information and Control},
Number = {2},
Pages = {131 - 136},
Title = {Three theorems on phrase structure grammars of type 1},
URL = {http://www.sciencedirect.com/science/article/pii/S0019995863901694},
Volume = {6},
Year = {1963},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0019995863901694},
bdsk-url-2 = {https://doi.org/10.1016/S0019-9958(63)90169-4},
date-added = {2019-05-30 22:35:10 +0200},
date-modified = {2019-05-30 22:35:10 +0200},
doi = {10.1016/S0019-9958(63)90169-4}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A