Conferences in DBLP
Helmut Alt , Jan van Leeuwen The complexity of complex division (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hajnal Andréka , István Németi , Ildikó Sain Henkin-type semantics for program-schemes to turn negative results to positive. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Antelmann , Lothar Budach , Hans-Anton Rollik Universal traps [Citation Graph (0, 0)][DBLP ] Conf ] André Arnold , Bernard Leguy Forets de Greibach et homomorphismes inverses. [Citation Graph (0, 0)][DBLP ] Conf ] Joffroy Beauquier Independence of linear and one-counter generators (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alexander R. Bednarek , S. M. Ulam An integer-valued metric for patterns. [Citation Graph (0, 0)][DBLP ] Conf ] Jan A. Bergstra , Jerzy Tiuryn Implicit definability of algebraic structures by means of program properties. [Citation Graph (0, 0)][DBLP ] Conf ] Meera Blattner , Jayashree Ramanathan A grammatical model for the top-down design of structured programs. [Citation Graph (0, 0)][DBLP ] Conf ] Ryszard Danecki , Marek Karpinski Decidability Results on Plane Automata Searching Mazes. [Citation Graph (0, 0)][DBLP ] Conf ] Max Dauchet , Jocelyne Mongy Transformations de noyaux reconnaissables. [Citation Graph (0, 0)][DBLP ] Conf ] Marie Demlová , Jiri Demel , Václav Koubek Several algorithms for finite algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst-Erich Doberkat Stability of linear space automata and semicontinuity of cut point languages. [Citation Graph (0, 0)][DBLP ] Conf ] Peter van Emde Boas Complexity of linear problems. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Ésik On functional tree transducers. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Grabowski Miscellaneous results on vector addition systems. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Hemmerling Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Gyula Horvath On machine maps in categories. [Citation Graph (0, 0)][DBLP ] Conf ] Masami Ito Input sets of strongly connected automata. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Jacob Elements de la theorie algebrique des arbres. [Citation Graph (0, 0)][DBLP ] Conf ] Ryszard Janicki Analysis of vectors of coroutines by means of components. [Citation Graph (0, 0)][DBLP ] Conf ] Ladislav Janiga Real-time computations of two-way multihead finite automata. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus P. Jantke Automatic synthesis of programs and inductive inference of functions. [Citation Graph (0, 0)][DBLP ] Conf ] Rainer Kemp The average depth of a prefix of the Dycklanguage D$. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kleine Büning Generalized vector addition systems with finite exception sets. [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen Automata and planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Latteux , Jeannine Leguy Une propriete de la famille GRE. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas The complexity of distributive computations. [Citation Graph (0, 0)][DBLP ] Conf ] Ernest G. Manes Partially-additive semantics: A progress report. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Merzenich Formal algebraic equations. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Müldner On compilation of parallel programs. [Citation Graph (0, 0)][DBLP ] Conf ] Andre D. Paradis , Gabriel Thierrin Strong endomorphisms of automata. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul Kolmogorov complexity and lower bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Pettorossi On the definition of hierarchies of infinite sequential computations. [Citation Graph (0, 0)][DBLP ] Conf ] Phan Dinh Dieu Some investigations on finite graphs and their applications. [Citation Graph (0, 0)][DBLP ] Conf ] Rimma I. Podlovchenko Simulating in research of functional equivalence of programs (on structure and problematics of program schemas' theory). [Citation Graph (0, 0)][DBLP ] Conf ] Przemyslaw Prusinkiewicz Recognizing of Chomsky classes of formal languages by two-dimensional iterative arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Helena Rasiowa Logic of complex algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Martin R. Raskovsky , Raymond Turner Compiler generation and denotational semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Christophe Reutenauer On Polya series in noncommuting variables. [Citation Graph (0, 0)][DBLP ] Conf ] Hans-Ulrich Simon Word problems for groups and contextfree recognition. [Citation Graph (0, 0)][DBLP ] Conf ] Peter H. Starke Semilinearity and Petri nets. [Citation Graph (0, 0)][DBLP ] Conf ] Kenichi Taniguchi , Toshio Matsuura , Yuji Sugiyama , Tadao Kasami On equivalence of safe Petri nets. [Citation Graph (0, 0)][DBLP ] Conf ] Vera Trnková Machines and their behaviour in a category. [Citation Graph (0, 0)][DBLP ] Conf ] Vera Trnková , Jirí Adámek Tree-group automata. [Citation Graph (0, 0)][DBLP ] Conf ] G. E. Tseytlin , E. L. Yushchenko Automata theory and structural parallel programming. [Citation Graph (0, 0)][DBLP ] Conf ] Lutz Voelkel Language recognition by linear bounded and copy programs. [Citation Graph (0, 0)][DBLP ] Conf ] Hermann K.-G. Walter Invariants of grammartransformations. [Citation Graph (0, 0)][DBLP ] Conf ] Gerd Wechsung The oscillation complexity and a hierarchy of context-free languages. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász On determinants, matchings, and random algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Hotz Necessary decidable conditions for the word and equivalence problem of formal languages. [Citation Graph (0, 0)][DBLP ] Conf ] 