| Type | Title | Author | Publisher | Year |
| Article | Test-score semantics as a basis for a computational approach to the representation of meaning | Zadeh, L.A. | | 1986 |
| Article | Is probability theory sufficient for dealing with uncertainty in AI: a negative view | Zadeh, L.A. | | 1986 |
| Article | Uber erkennbare und rationale mengen in freien partiell kommutativen monoiden | Fischer, W. | | 1986 |
| Article | A note on exponential density of ET0L languages | Meduna, A. | | 1986 |
| Article | The topological structures of adherences of regular languages | Head, T. | | 1986 |
| Article | A grammatical model of learning and fallibility | Kelemen, J. | | 1986 |
| Article | Iterative Tree Arrays with Logarithmic Depth | Culik II, K., Yu, S., Ibarra, O.H. | | 1986 |
| Article | Boundery NLC Graph Grammars---Basic Definitions, Normal Forms, and Complexity | Rozenberg, G., Welzl, E. | | 1986 |
| Article | Pushdown machines for the macro tree transducer | Engelfriet, J., Vogler, H. | | 1986 |
| Article | Semirings, automata, languages | Kuich, W., Salomaa, A. | | 1986 |
| Article | Denseness, maximality, and decidability of grammarical families | Maurer, H.A., Salomaa, A., Welzl, E., Wood, D. | | 1986 |
| Article | A note on exponential density of ET0L languages | Meduna, A. | | 1986 |
| Article | On Pebble Automata | Chang, J.H., Ibarra, O.H., Palis, M.A. | | 1986 |
| Article | Denseness, maximality, and decidability of grammarical families | Maurer, H.A., Salomaa, A., Welzl, E., Wood, D. | | 1986 |
| Article | On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages | Okawa, S., Hirose, S., Yoneda, M. | | 1986 |
| Article | Moderni programovani, dil 3, Syntakticka analyza a syntaxi rizeny preklad | Kral, J. | | 1986 |
| Article | Further remarks on pure grammars with regulated rewriting | Dassow, J., Paun, Gh. | | 1986 |
| Article | Square-free words on partially commutative free monoids | Carpi, A., De luca, A. | | 1986 |
| Article | Coordinated pair systems; Part II: Sparse structures of Dyck words and Ogden's lemma | Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G. | | 1986 |
| Article | Coordinated pair systems; Part I: Dyck works and classical pumping | Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G. | | 1986 |
| Article | Basic Tree Transducers | Vogler, H. | | 1986 |
| Article | Real-time, pseudo real-time, and linear-time ITA | Culik II, K., Yu, S. | | 1986 |
| Article | Pure Grammars with Regulated Rewriting | Dassow, J. | | 1986 |
| Article | Rule trees represent derivations in edge replacement systems | Kreowski, H.-J. | | 1986 |
| Article | F-Disjunctive Languages | Guo, Y.Q., Shyr, H.J., Thierrin, G. | | 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 |
