| Type | Title | Author | Publisher | Year |
| Article | Reality construction as problem oriented docomposition: between (social) constructivism and realism | Birrer, F.A.J. | | 1994 |
| Article | Tree adjunct languages as integer set recognizers | Biswas, S., Vaishnavi, V.K. | | 1978 |
| Article | Flowchart machines | Bjorner, D. | | 1970 |
| Article | A perspective on coding theory | Blake, I.F. | | 1991 |
| Article | Position-restricted grammar forms and grammars | Blattner, M., Ginsburg, S. | | 1982 |
| Article | Regularity and Transitivity of Local-Automorphism Semigroups of Locally Finite Forests | Blazkova, R., Chvalina, J. | | 1983 |
| Article | Regularity and transitivity of local-automorphism semigroups of locally finite forests | Blazkova, R., Chvaline, J. | | 1983 |
| Article | Linear languages and the intersection closures of classes of languages | Book, R., Nivat, M. | | 1978 |
| Article | Reversal-bounded acceptors and intersections of linear languages | Book, R., Nivat, M., Paterson, M. | | 1974 |
| Article | Time-bounded grammars and their languages | Book, R.V. | | 1971 |
| Article | On the complexity of formal grammars | Book, R.V. | | 1978 |
| Article | Translational lemmas, polynomial time, and (log n)^j-space | Book, R.V. | | 1976 |
| Article | Equality sets and complexity classes | Book, R.V., Brandenburg, F.-J. | | 1980 |
| Article | Tape-Bounded Turing Acceptors and Principal AFLs | Book, R.V., Greibach, S.A., Ibarra, O.H. | | 1970 |
| Article | Reset Machines | Book, R.V., Greibach, S.A., Wrathall, C. | | 1979 |
| Article | Time- and Tape-Bounded Turing Acceptors and AFLs | Book, R.V., Greibach, S.A.,Wegbreit, B. | | 1970 |
| Article | Formal Language Characterization of P, NP, and PSPACE | Borchert, B. | | |
| Article | A note on the degree of nondeterminism | Bordihn, H., Dassow, J. | | 1993 |
| Article | Accepting Grammars and Systems | Bordihn, H., Fernau, H. | | 1995 |
| Article | Accepting grammars and systems via context condition grammars | Bordihn, H., Fernau, H. | | 1996 |
| Article | Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems | Bordihn, H., Holzer, M. | | |
| Article | Efektivnost algoritmov softwarovych systemov I. | Bousa, J. et al. | | 1976 |
| Article | Algorithmes D'Analyse Syntaxique Pour Langages „Context-Free“ I | Brasseur, M., Cohen, J. | | 1965 |
| Article | Algorithmes D'Analyse Syntaxique Pour Langages „Context-Free“ II | Brasseur, M., Cohen, J. | | 1965 |
| Article | The recognition of deterministic CFL's in small time and space | Braunmuhl, B., Cook, S., Melhorn, K., Verbeek, R. | | |
| 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 |
