| Type | Title | Author | Publisher | Year |
| Article | One-pass transformations of attributed program trees | Ablas, H. | | 1987 |
| Article | Iteration of transformation passes over attributed program trees | Ablas, H. | | 1989 |
| Article | A fully equational proof of Parikh's theorem | Aceto, L., Esik, Z., Ingolfsdottir, A. | | 2001 |
| Article | Minimal Union-Free Decompositions of Regular Languages | Afonin, S., Golomazov, D. | | |
| Article | Nested Stack Automata | Aho, A.H. | | 1969 |
| Article | Properties of Syntax Directed Translations | Aho, A.H., Ullman, J.D. | | 1969 |
| Article | A recognition algorithm for pushdown store systems | Aho, A.V., Hopcroft, J.E., Ullman, J.D. | | |
| Article | On epsilon productions for terminals in E0L forms | Ainhirn, W., Maurer, H.A. | | 1979 |
| Article | Graph grammars with path-controlled embedding | Aizawa, K., Nakamura, A. | | 1991 |
| Article | Test sets for context free langauges and algebraic systems of equations over a free monoid | Albert, J., Culik II, K., Karhumaki, J. | | 1982 |
| Article | Test sets for context free langauges and algebraic systems of equations over a free monoid | Albert, J., Culik II, K., Karhumaki, J. | | 1982 |
| Article | A simple universal cellular automaton and its one-way and totalistic version | Albert, J., Culik Ii, K. | | 1987 |
| Article | On Sub Regular 0L Forms | Albert, J., Maurer, H.A., Ottmann, Th. | | 1981 |
| Article | Simple E0L forms under uniform interpretation generating CF languages | Albert, J., Maurer, H.A., Rozenberg, G. | | 1979 |
| Article | Checking Sets, Test Sets, Rich Languages and Commutative Closed Languages | Albert, J., Wood, D. | | 1983 |
| Article | Checking Sets, Test Sets, Rich Languages and Commutative-Closed Languages | Albert, J., Wood, D. | | 1982 |
| Article | Lower bounds on space complexity for contextfree recognition | Alt, H. | | 1979 |
| Article | Lower bounds for the space complexity of context-free recognition | Alt, H., Mehlhorn, K. | | 1976 |
| Article | On Efficient Entreeings | Amerins, P.S., Baeza-Yates, R.A., Wood, D. | | 1988 |
| Article | Afficient LR(1) Parsers | Anderson, T., Eve, J., Horning, J.J. | | 1973 |
| Article | Languages-theoretic problems arising from Richelieu cryptosystems | Andrasiu, M., Paun, Gh., Dassow, J., Salomaa, A. | | 1993 |
| Article | Minimizing finite state machines | Ashdown, I. | | 1988 |
| Article | Space-bounded complexity classes and iterated deterministic substitution | Asveld, P.R.J. | | 1980 |
| Article | Time and Space Complexity of Inside-Out Macro Languages | Asveld, P.R.J. | | 1981 |
| Article | Abstract grammars based on trasnductions | Asveld, P.R.J. | | 1991 |
| 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 |
