| Type | Title | Author | Publisher | Year |
| Article | Programming Language Concept for Structuring Control Software in Correspondence to the Technical Process | Schneider, H.J. | | 1985 |
| Article | Syntax-directed description of incremental compilers | Schneider, H.J. | | 1974 |
| Article | Conceptual data base description using graph-grammars | Schneider, H.J. | | 1976 |
| Article | Implementation of graph grammars using a pseudo-associative memory | Schneider, H.J. | | |
| Article | Graph Grammars | Schneider, H.J. | | 1977 |
| Article | Algebraic Specification of the Software Controlling a Parcels Distribution Machine | Schneider, H.J. | | 1981 |
| Article | Set-theoretic concepts in programming languages and their implementation | Schneider, H.J. | | 1980 |
| Article | Some remarks concerning the complexity of sorting and searching in an orthogonal memory | Schneider, H.J. | | 1984 |
| Article | Grammars on Partial Graphs | Schneider, H.J., Ehrig, H. | | 1975 |
| Article | Symplifying locking in a concurrent environment | Schrapp, M. | | 1984 |
| Article | Aufbau und Organisation | Schreiter, H. | | 1987 |
| Article | Grundlagen | Schreiter, H. | | 1987 |
| Article | On multiple context-free grammars | Seki, H., Matsumura, T., Fujii, M., Kasami, T. | | 1991 |
| Article | Automaticity and rationality | Shallit, J. | | 2000 |
| Article | Ambiguous translation grammars | Share, M. | | 1988 |
| Article | Logic hypergraph grammars and context-free hypergraph grammars | Shioya, I., Nakamura, K. | | 1991 |
| Article | Grammars for terms and automata | Siefkes, D. | | |
| Article | Finite automata, their algebras, and grammars. Towards a theory of formal expressions | Siefkes, D. | | 1988 |
| Article | Operating System Concepts | Silberschatz, A., Peterson, J., Galvin, P. | | 1991 |
| Article | A generalized transitive closure for relational queries | Sippu, S., Soisalon-Soininen, E. | | 1987 |
| Article | Parsing Thoery, volume II, LR(k) and LL(k) parsing | Sippu, S., Soisalon-Soininen, E. | | 1990 |
| Article | Finite-Turn Checking Automata | Siromoney, R. | | 1969 |
| Article | On infinite words obtained by selective substitution grammars | Siromoney, R., Dare, V.R. | | 1984 |
| Article | Parallel 0L-Languages | Siromoney, R., Siromoney, G. | | 1975 |
| Article | Selective substitution array grammars | Siromoney, R., Subramanian, K.G. | | 1981 |
| 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 |
