Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd FCT 1979: Wendisch-Rietz, Germany
- Lothar Budach:
Fundamentals of Computation Theory, FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979. Akademie-Verlag, Berlin 1979 - Helmut Alt, Jan van Leeuwen:
The complexity of complex division (extended abstract). FCT 1979: 13-17 - Hajnal Andréka, István Németi, Ildikó Sain:
Henkin-type semantics for program-schemes to turn negative results to positive. FCT 1979: 18-24 - Horst Antelmann, Lothar Budach, Hans-Anton Rollik:
Universal traps. FCT 1979: 25-30 - André Arnold, Bernard Leguy:
Forets de Greibach et homomorphismes inverses. FCT 1979: 31-37 - Joffroy Beauquier:
Independence of linear and one-counter generators (extended abstract). FCT 1979: 45-51 - Alexander R. Bednarek, Stanislaw M. Ulam:
An integer-valued metric for patterns. FCT 1979: 52-57 - Jan A. Bergstra, Jerzy Tiuryn:
Implicit definability of algebraic structures by means of program properties. FCT 1979: 58-63 - Meera Blattner, Jayashree Ramanathan:
A grammatical model for the top-down design of structured programs. FCT 1979: 71-83 - Ryszard Danecki, Marek Karpinski:
Decidability Results on Plane Automata Searching Mazes. FCT 1979: 84-91 - Max Dauchet, Jocelyne Mongy:
Transformations de noyaux reconnaissables. FCT 1979: 92-98 - Marie Demlová, Jirí Demel, Václav Koubek:
Several algorithms for finite algebras. FCT 1979: 99-104 - Ernst-Erich Doberkat:
Stability of linear space automata and semicontinuity of cut point languages. FCT 1979: 112-116 - Peter van Emde Boas:
Complexity of linear problems. FCT 1979: 117-120 - Zoltán Ésik:
On functional tree transducers. FCT 1979: 121-127 - Jan Grabowski:
Miscellaneous results on vector addition systems. FCT 1979: 146-152 - Armin Hemmerling:
Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces. FCT 1979: 167-174 - Gyula Horváth:
On machine maps in categories. FCT 1979: 182-186 - Masami Ito:
Input sets of strongly connected automata. FCT 1979: 187-192 - Gérard Jacob:
Elements de la theorie algebrique des arbres. FCT 1979: 193-206 - Ryszard Janicki:
Analysis of vectors of coroutines by means of components. FCT 1979: 207-213 - Ladislav Janiga:
Real-time computations of two-way multihead finite automata. FCT 1979: 214-218 - Klaus P. Jantke:
Automatic synthesis of programs and inductive inference of functions. FCT 1979: 219-225 - Rainer Kemp:
The average depth of a prefix of the Dycklanguage D$. FCT 1979: 230-236 - Hans Kleine Büning:
Generalized vector addition systems with finite exception sets. FCT 1979: 237-242 - Dexter Kozen:
Automata and planar graphs. FCT 1979: 243-254 - Michel Latteux, Jeannine Leguy:
Une propriete de la famille GRE. FCT 1979: 255-261 - Andrzej Lingas:
The complexity of distributive computations. FCT 1979: 262-268 - Ernest G. Manes:
Partially-additive semantics: A progress report. FCT 1979: 279-290 - Wolfgang Merzenich:
Formal algebraic equations. FCT 1979: 291-294 - Tomasz Müldner:
On compilation of parallel programs. FCT 1979: 295-300 - Andre D. Paradis, Gabriel Thierrin:
Strong endomorphisms of automata. FCT 1979: 318-324 - Wolfgang J. Paul:
Kolmogorov complexity and lower bounds. FCT 1979: 325-334 - Alberto Pettorossi:
On the definition of hierarchies of infinite sequential computations. FCT 1979: 335-341 - Phan Dinh Dieu:
Some investigations on finite graphs and their applications. FCT 1979: 342-348 - Rimma I. Podlovchenko:
Simulating in research of functional equivalence of programs (on structure and problematics of program schemas' theory). FCT 1979: 349-354 - Przemyslaw Prusinkiewicz:
Recognizing of Chomsky classes of formal languages by two-dimensional iterative arrays. FCT 1979: 355-361 - Helena Rasiowa:
Logic of complex algorithms. FCT 1979: 370-381 - Martin R. Raskovsky, Raymond Turner:
Compiler generation and denotational semantics. FCT 1979: 382-386 - Christophe Reutenauer:
On Polya series in noncommuting variables. FCT 1979: 391-396 - Hans Ulrich Simon:
Word problems for groups and contextfree recognition. FCT 1979: 417-422 - Peter H. Starke:
Semilinearity and Petri nets. FCT 1979: 423-429 - Kenichi Taniguchi, Toshio Matsuura, Yuji Sugiyama, Tadao Kasami:
On equivalence of safe Petri nets. FCT 1979: 430-436 - Vera Trnková:
Machines and their behaviour in a category. FCT 1979: 450-461 - Vera Trnková, Jirí Adámek:
Tree-group automata. FCT 1979: 462-468 - G. E. Tseytlin, E. L. Yushchenko:
Automata theory and structural parallel programming. FCT 1979: 469-475 - Lutz Voelkel:
Language recognition by linear bounded and copy programs. FCT 1979: 491-495 - Hermann K.-G. Walter:
Invariants of grammartransformations. FCT 1979: 496-507 - Gerd Wechsung:
The oscillation complexity and a hierarchy of context-free languages. FCT 1979: 508-515 - László Lovász:
On determinants, matchings, and random algorithms. FCT 1979: 565-574 - Günter Hotz:
Necessary decidable conditions for the word and equivalence problem of formal languages. FCT 1979: 575-576
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-13 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
