Abstract is missing.
- The complexity of complex division (extended abstract)Helmut Alt, Jan van Leeuwen. 13-17
- Henkin-type semantics for program-schemes to turn negative results to positiveHajnal Andréka, István Németi, Ildikó Sain. 18-24
- Universal trapsHorst Antelmann, Lothar Budach, Hans-Anton Rollik. 25-30
- Forets de Greibach et homomorphismes inversesAndré Arnold, Bernard Leguy. 31-37
- Independence of linear and one-counter generators (extended abstract)Joffroy Beauquier. 45-51
- An integer-valued metric for patternsAlexander R. Bednarek, S. M. Ulam. 52-57
- Implicit definability of algebraic structures by means of program propertiesJan A. Bergstra, Jerzy Tiuryn. 58-63
- A grammatical model for the top-down design of structured programsMeera Blattner, Jayashree Ramanathan. 71-83
- Decidability Results on Plane Automata Searching MazesRyszard Danecki, Marek Karpinski. 84-91
- Transformations de noyaux reconnaissablesMax Dauchet, Jocelyne Mongy. 92-98
- Stability of linear space automata and semicontinuity of cut point languagesErnst-Erich Doberkat. 112-116
- Complexity of linear problemsPeter van Emde Boas. 117-120
- Miscellaneous results on vector addition systemsJan Grabowski. 146-152
- Input sets of strongly connected automataMasami Ito. 187-192
- Elements de la theorie algebrique des arbresGérard Jacob. 193-206
- Analysis of vectors of coroutines by means of componentsRyszard Janicki. 207-213
- Real-time computations of two-way multihead finite automataLadislav Janiga. 214-218
- Automatic synthesis of programs and inductive inference of functionsKlaus P. Jantke. 219-225
- The average depth of a prefix of the Dycklanguage D Rainer Kemp. 230-236
- Generalized vector addition systems with finite exception setsHans Kleine Büning. 237-242
- Automata and planar graphsDexter Kozen. 243-254
- Une propriete de la famille GREMichel Latteux, Jeannine Leguy. 255-261
- The complexity of distributive computationsAndrzej Lingas. 262-268
- Partially-additive semantics: A progress reportErnest G. Manes. 279-290
- Formal algebraic equationsWolfgang Merzenich. 291-294
- On compilation of parallel programsTomasz Müldner. 295-300
- Strong endomorphisms of automataAndre D. Paradis, Gabriel Thierrin. 318-324
- Kolmogorov complexity and lower boundsWolfgang J. Paul. 325-334
- On the definition of hierarchies of infinite sequential computationsAlberto Pettorossi. 335-341
- Some investigations on finite graphs and their applicationsPhan Dinh Dieu. 342-348
- Simulating in research of functional equivalence of programs (on structure and problematics of program schemas theory)Rimma I. Podlovchenko. 349-354
- Recognizing of Chomsky classes of formal languages by two-dimensional iterative arraysPrzemyslaw Prusinkiewicz. 355-361
- Logic of complex algorithmsHelena Rasiowa. 370-381
- Compiler generation and denotational semanticsMartin R. Raskovsky, Raymond Turner. 382-386
- On Polya series in noncommuting variablesChristophe Reutenauer. 391-396
- Word problems for groups and contextfree recognitionHans-Ulrich Simon. 417-422
- Semilinearity and Petri netsPeter H. Starke. 423-429
- On equivalence of safe Petri netsKenichi Taniguchi, Toshio Matsuura, Yuji Sugiyama, Tadao Kasami. 430-436
- Machines and their behaviour in a categoryVera Trnková. 450-461
- Tree-group automataVera Trnková, Jirí Adámek. 462-468
- Automata theory and structural parallel programmingG. E. Tseytlin, E. L. Yushchenko. 469-475
- Language recognition by linear bounded and copy programsLutz Voelkel. 491-495
- Invariants of grammartransformationsHermann K.-G. Walter. 496-507
- On determinants, matchings, and random algorithmsLászló Lovász. 565-574
- Necessary decidable conditions for the word and equivalence problem of formal languagesGünter Hotz. 575-576