| Type | Title | Author | Publisher | Year |
| Article | A note on the structure of certain predicates concerning the sublanguages of Algol 60 | Kopriva, J. | | 1965 |
| Article | A note on the succinctness of descriptions of deterministic languages | Valiant, L.G. | | 1976 |
| Article | A note on top-down deterministic languages | Wood, D. | | 1969 |
| Article | A periodic division pattern that cannot be generated by D0L systems | de Boer, M.J.M., Lindenmayer, A. | | 1991 |
| Article | A perspective on coding theory | Blake, I.F. | | 1991 |
| Article | A perti net for workflow modelling | Kolar, D. | | |
| Article | A prime decomposition theorem for grammatical families | Ginsburg, S. | | 1982 |
| Article | A programming notation for locally synchronized algorithms | Cremers, A.R., Hibbard, T.N. | | 1985 |
| Article | A pumping lemma for random permitting context languages | Ewert, S., van der Walt, A. | | 2002 |
| Article | A pushdown automton or acontext-free grammar which is more economical? | Goldstine, J., Price, J.K., Wotschke, D. | | 1981 |
| Article | A recognition algorithm for pushdown store systems | Aho, A.V., Hopcroft, J.E., Ullman, J.D. | | |
| Article | A recursive procedure for compiling expressions | Fabian, V. | | 1963 |
| Article | A remark on Limited 0L Systems | Dassow, J. | | 1988 |
| Article | A sentence generator for testing parsers | Purdom, P. | | 1972 |
| Article | A shrinking lemma for random forbidding context languages | Ewert, S., van der Walt, A. | | 2000 |
| Article | A simple proof of the Steiner ratio conjecture for five points | Friedel, J., Widmayer, P. | | 1988 |
| Article | A simple universal cellular automaton and its one-way and totalistic version | Albert, J., Culik Ii, K. | | 1987 |
| Article | A simple variable-free CF grammar generating a non regular language | Hagauer, J. | | 1978 |
| Article | A simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination | Zadeh, L.A. | | 1986 |
| Article | A simple view of the dempster-shafer theory of evidence and its implication for the rule of combination | Zadeh, L.A. | | 1986 |
| Article | A simultaneous reduction of several measures of descriptional complexity in scattered context grammars | Fernau, H., Meduna, A. | | 2003 |
| Article | A sketch of collage grammars | Drewes, F., Habel, A., Kreowski, H.-J., Taubenberger, S. | | 1993 |
| Article | A subsumption architecture for generative symbol systems | Kelemen, J., Kelemenova, A. | | 1992 |
| Article | A super normal form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1980 |
| Article | A supernormal-form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 |
