| Type | Title | Author | Publisher | Year |
| Article | Implementation of Sequential and Parallel Graph Rewriting Systems | Brendel, W., Nagl, M., Weber, D. | | 1978 |
| Article | Drawing trees nicely with TeX | Bruggemann-Klein, A., Wood, D. | | 1987 |
| Article | Classification of noncounting events | Brzozowski, J.A., Culik II, K., Gabrielian, A. | | 1971 |
| Article | Two-symbol D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | Two-symbols D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | A note on a problem in the theory of grammatical complexity | Bucher, W. | | 1981 |
| Article | On rela time and linear time cellular automata | Bucher, W., Culik II, K. | | 1984 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | Context-free complexity of finite languages | Bucher, W., Maurer, H.A., Culik II, K. | | 1984 |
| Article | Context-free complexity of finite languages | Bucher, W., Maurer, H.A., Culik II, K. | | 1984 |
| Article | Concise description of finite languages | Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D. | | 1981 |
| Article | Concise description of finite languages | Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D. | | 1981 |
| Article | Concise description of finite languages | Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D. | | 1981 |
| Article | Projections of reachability sets of vector addition systems are semilinear | Bunig, H.K., Lettmann, Th. | | 1984 |
| Article | Wachsende kontextsensitive sprachen | Buntock, G. | | 1996 |
| Article | Stream processing functions | Burge, W.H. | | 1975 |
| Article | A transformation system for developing recursive programs | Burstall, R.M., Darlington, J. | | 1977 |
| Article | On the Syntactic Structures of Unrestricted Grammars II. Automata | Buttelmann, H.W. | | 1975 |
| Article | On the Syntactic Structures of Unrestricted Grammars I. Generative Grammars and Phrase Structure Grammars | Buttelmann, H.W. | | 1975 |
| Article | Square-free words on partially commutative free monoids | Carpi, A., De luca, A. | | 1986 |
| Article | Non-repetitive words relative to a rewriting systém | Carpi, A., De luca, A. | | 1990 |
| Article | On the transition graphs of automata and grammars | Caucal, D., Monfort, R. | | 1990 |
| Article | On generalized words of Thue-Morse | Cerny, A. | | 1986 |
| 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 |
