%A Arnold Schonhage %T A lower bound for the length of addition chains %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 1-12 %A Michael S. Paterson %T Complexity of monotone networks for boolean matrix product %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 13-20 %A Volker Strassen %T Die berechnungskomplexitat der symbolischen differentiation von interpolationspolynomen %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 21-25 %A G.P. Huet %T A unification algorithm for typed lambda-calculus %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 27-57 %A A. Ehrenfeuch %A K.P. Lee %A G. Rozenberg %T Subword complexities of various classes of deterministic developmental languages without interactiuons %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 59-75 %A Ann Reedy %A Walter J. Savitch %T The Turing degree of the inherent ambiguity problem for context-free languages %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 77-91 %A Antonio Restivo %T A combinatorial property of codes having finite synchronization delay %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 95-101 %A R.E. Ladner %A N.A. Lynch %A A.L. Selman %T A comparison of polynomial time reducibilities %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 103-123 %A G.D. Plotkin %T Call-by-name, call-by-value and the lambda-calculus %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 125-159 %A L.H. Harper %A W.N. Hsieh %A J.E. Savage %T A class of boolean functions with linear combinational complexity %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 161-183 %A F.P. Preparata %T A fast stable sorting algorithm with absolutely minimum storage %J Theoretical Computer Science %K tcs %V 1 %D 1975 %P 185-190 %A Robert Moll %T An operator embedding theorem for complexity classes of recursive functions %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 193-198 %A Jan van\ Leeuwen %A Derick Wood %T A decomposition theorem for hyper-algebraic extensions of language families %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 199-214 %A Ronald V. Book %T Translational lemmas, polynomial time, and (log n)^j-space %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 215-226 %A Maurice Mignotte %T Algorithmes reletifs a la decomposition des polynomes %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 227-235 %A M.R. Garey %A D.S. Johnson %T Some simplified NP-complete graph problems %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 236-267 %A S.A. Greibach %T Remarks on the complexity of nondeterministic counter languages %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 269-288 %A C.P. Schnorr %T The combinational complexity of equivalence %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 289-295 %A Emily P. Friedman %T The inclusion problem for simple languages %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 297-316 %A Juhani Karhumaki %T Two theorems concerning recognizable N-subsets of sigma* %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 317-323 %A A. Ehrenfeucht %A G. Rozenberg %A S. Skyum %T A relationship between ET0L and EDT0L languages %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 325-330 %A Wiktor Marek %A Zdzislaw Pawlak %T Information storage and retrieval systems: mathematical foundations %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 331-354 %A Michael L. Fredman %T How good is the information theory bound in sorting ? %J Theoretical Computer Science %K tcs %V 1 %D 1976 %P 355-361 %A Ivan Meznik %T On some subclasses of the class of generable languages %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 1-7 %A Joost Engelfriet %T Surface tree languages and parallel derivation trees %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 9-27 %A Seymour Ginsburg %A Jonathan Goldstine %A Sheila Greibach %T Some uniformly erasable families of languages %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 29-44 %A Gregory J. Chaitin %T Information-theoretic characterization of recursive infinite strings %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 45-48 %A Paul M.B. Vitanyi %T Deterministic Lindenmayer languages, nonterminals and homomorphisms %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 49-71 %A Michael Machtey %T Minimal pairs of polynomial degrees with subexponential complexity %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 73-76 %A Michel Hack %T The equality problem for vector addition systems is undecidable %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 77-95 %A Jean-Jacques Levy %T An algebraic interpretation of the lambda-beta-K calculus; and an application of a labelled lambda-calculus %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 97-114 %A Gabor T. Herman %A Adrian Walker %T On the stability of some biological schemes with cellular interactions %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 115-130 %A Herbert Egli %A Robert L. Constable %T Computability concepts for programming language semantics %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 133-145 %A J.I. Seiferas %A R. McNaughton %T Regularity-preserving relations %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 147-154 %A J.W. de\ Bakker %T Least fixed points revisited %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 155-181 %A Barry K. Rosen %T Correctness of parallel programs: the Church-Rosser approach %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 183-207 %A L. Boasson %T Langages algebriques, paires iterantes et transductions rationelles %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 209-223 %A Mark B. Trakhtenbrot %T Relationship between classes of monotonic functions %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 225-247 %A Bostjan Vilfan %T Lower bounds for the size of expressions for certain functions in d-ary logic %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 249-269 %A Oscar H. Ibarra %A Sartaj K. Sahni %A Chut E. Kim %T Finite automata with multiplication %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 271-294 %A Fred Neil Springsteel %T On the pre-AFL of [log n] space and related families of languages %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 295-304 %A C.P. Schnorr %T A lower bound on the number of additions in monotone computations %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 305-315 %A Matti Soittola %T Positive rational sequences %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 317-322 %A Mariangiola Dezani-Ciancaglini %T Characterization of normal forms possessing inverse in the lambda-beta-eta-calculus %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 323-337 %A Shimon Even %A Robert Endre Tarjan %T Computing an st-numbering %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 339-344 %A Eliana Minicozzi %T Some natural properties of strong-identification in inductive inference %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 345-360 %A H.B. Hunt,\ III %A D.J. Rosenkrantz %A T.G. Szymanski %T The covering problem for linear context-free grammars %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 361-382 %A Wolfgang J. Paul %T Realizing boolean functions on disjoint sets of variables %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 383-396 %A M.S. Paterson %A L.G. Valiant %T Circuit size is nonlinear in depth %J Theoretical Computer Science %K tcs %V 2 %N 1976 %P 397-400 %A Larry J. Stockmeyer %T The polynomial-time hierarchy %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 1-22 %A Celia Warthall %T Complete sets and the polynomial-time hierarchy %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 23-33 %A Gerard Lallement %T Regular semigroups with D = R as syntactic monoids of prefix codes %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 35-49 %A Gunter Hotz %T Schranken fur balanced trees bei ausgewogenen verteilungen %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 51-59 %A Burkhard Monien %T A recursive and a grammatical characterization of the exponential-time languages %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 61-74 %A K. Culik,\ II %T On the decidability of the sequence equivalence problem for D0L-systems %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 75-84 %A Toshiro Araki %A Tadao kasami %T Some decision problems related to the reachability problem for Petri nets %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 85-104 %A Neil D. Jones %A William T. Laaser %T Complete problems for deterministic polynomial time %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 105-117 %A D.C. Jensen %A T. Pietrzykowski %T Mechanizing omega-order type theory through unification %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 123-171 %A David Park %T Finiteness is mu-ineffable %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 173-181 %A Witold Lipski,\ Jr. %T Information storage and retrieval - mathematical foundations II (combinatorial problems) %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 183-211 %A J. Hartmanis %A L. Berman %T On tape bounds for single letter alphabet language processing %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 213-224 %A Henk Barendregt %T A global representation of the recursive functions in the lambda-calculus %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 225-242 %A M.P. Schutzenberger %T Sur les relations rationelles entre monoides libres %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 243-259 %A Peter H. Starkes %T Analyse und synthese von asynchronen nondeterministic-automaten %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 261-266 %A Arnold Schonhage %T An elementary proof for Strassen's degree bound %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 267-272 %A Thomas G. Szymanski %T Concerning bounded-right-context grammars %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 273-282 %A Keijo Ruohonen %T Zeros of Z-rational functions and D0L equivalence %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 283-292 %A Ashok K. Chandra %A D.S. Hirschberg %A C.K. Wong %T Approximate algorithms for some generalized knapsack problems %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 293-304 %A C. Beeri %T An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 305-320 %A Donald E. Knuth %A Luis Trabb Pardo %T Analysis of a simple factorization algorithm %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 321-348 %A Richard J. Lipton %A David Dobkin %T Complexity measures and hierarchies for the evaluation of integers and polynomials %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 349-357 %A David S. Wise %T A strong pumping lemma for context-free languages %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 359-369 %A Ronald L. Rivest %A Jean Vuillemin %T On recognizing graph properties from adjacency matrices %J Theoretical Computer Science %K tcs %V 3 %D 1976 %P 371-384 %A Robin Milner %T Fully abstract models of typed lambda-calculi %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 1-22 %A Zvi Galil %T On the complexity of regular resolution and the Davis-Putnam procedure %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 23-46 %A M.P. Schutzenberger %T Sur une variante des fonctions sequentielles %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 47-57 %A Daniel J. Lehmann %T Algebraic structures for transitive closures %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 59-76 %A Jean Vuillemin %T Comment verifier l'associative d'une table de groupe %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 77-82 %A Matti Linna %T A decidabilty result for deterministic omega-context-free languages %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 83-98 %A Toshiro Araki %A Tadao Kasami %T Decidable problems on the strong connectivity of Petri net reachability sets %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 99-119 %A George Markowsky %T Categories of chain-complete posets %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 125-135 %A Chiharu Hosono %A Masahiko Sato %T The retracts in Pomega do not form a continuous lattice - a solution to Scott's problem %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 137-142 %A Matthew M. Geller %A Harry B. Hunt,\ III %A Thomas G. Szymanski %A Jeffrey D. Ullman %T Economy of description by parsers, DPDA's and PDA's %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 143-153 %A Jean Francon %T On the analysis of algorithms for trees %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 155-169 %A Hans-George Stork %T On the paging-complexity of periodic arrangements %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 171-197 %A H. Maurer %A Th. Ottman %A A. Salomaa %T On the form equivalence of L-forms %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 199-225 %A Jeanne Ferrante %A James R. Geiser %T An AFF decision procedure for the theory of rational order %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 227-233 %A Daniel J. Lehmann %T A note on Schorr's separatedness %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 235 %A Christos H. Papadimitriou %T The Euclidean travelling salesman problem is NP-complete %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 237-244 %A Matthew M. Geller %A Michael A. Harrison %T On LR(k) grammars and languages %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 245-276 %A Neil D. Jones %A Lawrence H. Landweber %A Y. Edmund Lien %T Complexity of some problems in Petri nets %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 277-299 %A Robert Daley %T On the inference of optimal descriptions %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 301-319 %A Tmima Olshansky %A Amir Pnueli %T A direct algorithm for checking equivalence of LL(k) grammars %J Theoretical Computer Science %K tcs %V 4 %D 1977 %P 321-349 %A Walter A. Burkhard %T Non-uniform partial-match file designs %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 1-23 %A Y.S. Kwong %T On reduction of asynchronous systems %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 25-50 %A Laurent Chottin %T Etude syntaxique de certains langages solutions d'equations avec operateurs %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 51-84 %A Joost Engelfriet %T Iterating iterated substitution %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 85-100 %A Arnaldo Mandel %A Imre Simon %T On finite semigroups of matrices %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 101-111 %A Armin B. Cremers %A Thomas N. Hibbard %T On the formal definition of dependencies between the control and information structure of a data space %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 113-128 %A Michel Latteux %T Produit dans le cone rationnel engendre par D %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 129-134 %A L. Aiello %A M. Aiello %A R.W. Weyhrauch %T Pascal in LCF: semantics and examples of proof %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 135-177 %A Zvi Galil %A Nimrod Megiddo %T Cyclic ordering is NP-complete %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 179-182 %A Gerard Jacob %T Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 183-204 %A M.D. Atkinson %T The complexity of group algebra computations %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 205-209 %A Juhani Karhumaki %T Remarks on commutative N-rational series %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 211-217 %A Christophe Reutenauer %T On a question of S. Eilenberg %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 219 %A G.D. Plotkin %T LCF considered as a programming language %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 223-255 %A M.B. Smyth %T Effectively given domains %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 257-274 %A Calvin C. Elgot %A Lawrence Snyder %T On the many facets of lists %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 275-305 %A Seymour Ginsburg %A Edwin H. Spanier %T Pushdown acceptor forms %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 307-320 %A Horst Luckhardt %T A fundamental effect in computations on real numbers %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 321-324 %A Christian Choofrut %T Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles et tant que relations rationelles %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 325-337 %A G. Rozenberg %A M. Penttonen %A A. Salomaa %T Bibliography of L systems %J Theoretical Computer Science %K tcs %V 5 %D 1977 %P 339-354 %K Lindenmayer %A Rina S. Cohen %A Arie Y. Gold %T omega-computations on Turing machines %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 1-23 %A Nancy Lynch %T Log space machines with multiple oracle tapes %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 25-39 %A Harold Abelson %T Towards a theory of local and global in computation %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 41-67 %A K. Culik,\ II %A H.A. Maurer %A Th. Ottman %T On two-symbol complete E0L forms %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 69-92 %A D.S. Johnson %A F.P. Preparata %T The densent hemisphere problem %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 93-107 %A Zohar Manna %A Adi Shamir %T The convergence of functions to fixedpoints of recursive definitions %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 109-141 %A K. Culik,\ II %A H.A. Maurer %A Th. Ottman %A K. Ruohonen %A A. Salomaa %T Isomorphism, form equivalence and sequence equivalence of PD0L forms %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 143-173 %A S.A. Greibach %T One way finite visit automata %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 175-221 %A Charles Rackoff %T The covering and boundedness problems for vector addition systems %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 223-231 %A Victor L. Bennison %A Robert J. Soare %T Some lowness properties and computational complexity sequences %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 233-254 %A Bruno Courcelle %T A representation of trees by languages I %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 255-279 %A Donald E. Knuth %A Arnold Schonhage %T The expected linearity of a simple equivalence algorithm %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 281-315 %A Dorothy Bollman %A Miguel Laplaza %T Some decision problems for polynomial mappings %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 317-325 %A A. Ehrenfeucht %A G. Rozenberg %T E0L languages are not codings of EP0L languages %J Theoretical Computer Science %K tcs %V 6 %D 1978 %P 327-341 %A Hans F. de\ Groote %T On variaties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 1-24 %A Bruno Courcelle %T A representation of trees by languages II %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 25-55 %A J.B. Wright %A E.G. Wagner %A J.W. Thatcher %T A uniform approach to inductive posets and inductive closure %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 57-77 %A P. van\ Emde\ Boas %T Some applications of the McCreight-Meyer algorithm in abstract complexity theory %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 79-98 %A R. Verbeek %A K. Weihrauch %T Data representation and computational complexity %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 99-116 %A M. Mignotte %T Intersection des images de certaines suites recurrences lineaires %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 117-122 %A Hans F. de\ Groote %T On variaties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2*2 matrix multiplication %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 127-148 %A Kojiro Kobayashi %T On the minimal firing time of the firing squad synchronization problem for polyautomata networks %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 149-167 %A A. Ehrenfeucht %A G. Rozenberg %T Elementary homomorphisms and a solution of the D0L equivalence problem %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 169-183 %A Ronald V. Book %A Celia Wrathall %T On languages specified by relative acceptance %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 185-195 %A J.-F. Perrot %T Varietes de langages et operations %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 197-210 %A J.E. Pin %T Sur le monoide syntactique de L* lorsque L est un langage fini %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 211-215 %A D.E. Muller %A F.P. Preparata %T Finding the intersection of two convex polyhedra %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 217-236 %A Hans F. de\ Groote %T On variaties of optimal algorithms for the computation of bilinear mappings III. optimal algorithms for the computation of xy and yx where x, y memberof M2(K) %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 239-249 %A C.P. Schnorr %T Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 251-261 %A Sven Skyum %T On good ET0L forms %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 263-272 %A J. Hartmanis %T On log-tape isomorphisms of complete sets %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 273-286 %A Oscar H. Ibarra %T On two-way sequentiel transductions of full semi-AFL's %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 287-309 %A S.A. Greibach %T Remarks on blind and partially blind one-way multicounter machines %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 311-324 %A Mark Kleiman %A Nicholas Pippenger %T An explicit construction of short monotone formulae for the monotone symmetric functions %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 325-332 %A Emily P. Friedman %T A note on non-singular deterministic pushdown automata %J Theoretical Computer Science %K tcs %V 7 %D 1978 %P 333-339 %A Eljas Soisalon-Soininen %T On the covering problem for left-recursive grammars %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 1-11 %A Mitchell Wand %T Fixed-point constructions in order-enriched categories %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 13-30 %A W. Bibel %T Tautology testing with a generalized matrix reduction method %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 31-44 %A F.P. Preparata %A D.E. Muller %T Finding the intersection of n half-spaces in time O(n log n) %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 45-55 %A Peter Johansen %T The generating function of the number of subpatterns of a D0L sequence %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 57-68 %A Kosaburo Hashiguchi %T A decision procedure for the order of regular events %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 69-72 %A Krzysztof R. Apt %A J.A. Bergstra %A Lambert G.L.T. Meertens %T Recursive assertions are not enough - or are they ? %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 73-87 %A Mila E. Majster %T Data types, abstract data types and their specification problem %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 89-127 %A John Hopcroft %A Jean-jacques Pansiot %T On the reachability problem for 5-dimensional vector addition systems %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 129-159 %A Helmut Prodinger %A Friedrich J. Urbanek %T Language operators related to Init %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 161-175 %A Theodore P. Baker %A Alan L. Selman %T A second step toward the polynomial hierarchy %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 177-187 %A L.G. Valiant %T The complexity of computing the permanent %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 189-201 %A Pavel Pudlak %A F.N. Springsteel %T Complexity in mechanized hypothesis formation %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 203-225 %A Petr Hajek %T Arithemtical hierarchy and complexity of computation %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 227-237 %A Juris Hartmanis %T Relations between diagonalization, proof systems, and complexity gaps %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 239-253 %A Jacques Morgenstern %T Une extension du theoreme de Winograd %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 255-259 %A Andre Arnold %A Michel Latteux %T A new proof of two theorems about rational transductions %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 261-263 %A C. Bohm %A M. Dezani-Ciancaglini %A P. Peretti %A S. Ronchi della\ Rocca %T A discrimination algorithm inside lambda-beta-calculus %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 271-291 %A Joffroy Beauquier %T Generateurs algebriques et systemes de paires iterantes %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 293-323 %A Calvin C. Elgot %A John C. Shepherdson %T A semantically meaningful characterization of reducible flowchart schemes %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 325-357 %A S. Winograd %T On multiplication in algebraic extension fields %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 359-377 %A Danny Dolev %T Commutation properties and generating sets characterize slices of various synchronization primitives %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 379-391 %A R. Hindley %T The discrimination theorem holds for combinatory weak reduction %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 393-394 %A Jean-Michel Autebert %T Une note sur le cylindre des langages deterministes %J Theoretical Computer Science %K tcs %V 8 %D 1979 %P 395-399 %A David A. Plaisted %T Fast verification, testing, and generation of large primes %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 1-16 %A Jean-Pierre Duval %T Periodes et repetitions des mots du monoide libre %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 17-26 %A J. Bergstra %A J.W. Klop %T Church-Rosser strategies in the lambda calculus %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 27-38 %K lambda reduction %X discusses some problems of Church-Rosser strategies %A Irene Guessarian %T Program transformations and algebraic semantics %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 39-65 %A Richard Statman %T Intuitionistic propositional logic is polynomial-space complete %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 67-72 %A Richard Statman %T The typed lambda-calculus is not elementary recursive %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 73-81 %A Ingo Wegener %T Switching functions whose monotone complexity is nearly quadratic %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 83-97 %A P. Flajolet %A J.C. Raoult %A J. Vuillemin %T The number of registers required for evaluating arithmetic expressions %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 99-125 %A Gerd Wechsung %A Andreas Brandstadt %T A relation between space, return and dual return complexities %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 127-140 %A Gilles Christol %T Ensembles presque periodiques k-reconnaissables %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 141-145 %A Ingo Wegener %T A counterexample to a conjecture of Schnorr referring to monotone networks %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 147-150 %A A. Tang %T Chain properties in Pomega %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 153-172 %A Michael A. Harrison %A Ivan M. Havel %A Amiram Yehudai %T On equivalence of grammars through transformation trees %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 173-205 %A Juhani Karhumaki %T On commutative DT0L systems %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 207-220 %A Dominique Perrin %T La representation ergodique d'un automate fini %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 221-241 %A Edward A. Ashcroft %A Faith E. Fich %T A generalized setting for fixpoint theory %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 243-256 %A Stephen L. Bloom %A Ralph Tindell %T Algebraic and graph theoretic characterizations of structured flowchart schemes %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 265-286 %A Anton Nijholt %T Simple chain grammars and languages %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 287-309 %A Katsushi Inoue %A Itsuo Takanami %A Akira Nakamura %A Tadashi Ae %T One-way simpel multihead finite automata %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 311-328 %A Raymond Aubin %T Mechanizing structural induction part I: formal system %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 329-345 %A Raymond Aubin %T Mechanizing structural induction part II: strategies %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 347-362 %A Christophe Reutenauer %T Sur les series associees a certains systemes de Lindenmayer %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 363-375 %A Keijo Ruohonen %T On some decidability problems for HD0L systems with nonsingular Parikh matrices %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 377-384 %A F. Rodriguez %T Familles de langages fermees par crochet ouvert %J Theoretical Computer Science %K tcs %V 9 %D 1979 %P 385-398 %A C.P. Schnorr %A J.P. Van\ de\ Wiele %T On the additive complexity of polynomials %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 1-18 %A J.A. Brzozowski %A E. Leiss %T On equations for regular languages, finite automata, and sequential networks %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 19-35 %A Petr Kurka %T Applicability of a production in a categorical grammar %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 37-44 %A A. Ehrenfeucht %A G. Rozenberg %T Every two equivalent D0L systems have a regular true envelope %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 45-52 %A Werner Hartmann %A Peter Schusetr %T Multiplicative complexity of some rational functions %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 53-61 %A S. Zaks %T Lexicographic generation of ordered trees %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 63-82 %A C.P. Schnorr %T A 3n-lower bound on the network complexity of boolean functions %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 83-92 %A Joachim Biskup %T Inferences of multivalued dependencies in fixed and undetermined universes %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 93-105 %A Helmut Prodinger %T On the interpolation of D0L-sequences %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 107-108 %A Steven Fortune %A John Hopcroft %A James Wyllie %T The directed subgraph homeomorphism problem %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 111-121 %A Karl Lieberherr %T P-optimal heuristics %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 123-131 %A E. Wiedmer %T Computing with infinite objects %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 133-155 %A Aldo de\ Luca %A Antonio Restivo %T On some properties of very pure codes %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 157-170 %A John Staples %T Computation of graph-like expressions %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 171-185 %A Ivan M. Havel %T On branching and looping, part I %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 187-220 %A Dexter Kozen %T Complexity of boolean algebras %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 221-247 %A Rina Cohen %A Arie Gold %T On the complexity of omega-type Turing acceptors %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 249-272 %A Ivan M. Havel %T On branching and looping, part II %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 273-295 %A John Staples %T Optimal evaluations of graph-like expressions %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 297-316 %A K.N. King %T Iteration theorems for families of strict deterministic languages %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 317-333 %A Michael Sipser %T Halting space-bounded computations %J Theoretical Computer Science %K tcs %V 10 %D 1980 %P 335-338 %A David P. Dobkin %T The complexity of linear programming %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 1-18 %A Jan Bergstra %A Jan Willem Klop %T Invertible terms in the lambda calculus %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 19-37 %A John Staples %T Speeding up subtree replacement systems %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 39-47 %A Nicholas Pippenger %T On another boolean matrix %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 49-56 %A Anna R. Bruss %A Albert R. Meyer %T On time-space classes and their relation to the theory of real addition %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 57-69 %A Leonard Berman %T The complexity of logical theories %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 71-77 %A Masato Morisaki %A Ko Sakai %T A complete axiom system for rational sets with multiplicity %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 79-92 %A Ludek Kucera %A Jaroslav Nesetril %A Ales Pultr %T Complexity of dimension three and some related edge-covering characteristics of graphs %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 93-106 %A Gunter Hotz %T Eine neue invariante fur kontextfreie sprachen %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 107-116 %A Frank Harary %T Graph theoretic models %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 117-121 %A Egon Borger %A Hans Kleine Buning %T The reachability problem for Petri nets and decision problems for Skolem arithmetic %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 123-143 %A Arnold L. Rosenberg %A Larry J. Stockmeyer %T Uniform data encodings %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 145-165 %A W.M. Beynon %T On the structure of free finite state machines %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 167-180 %A A. Arnold %A M. Nivat %T Metric interpretations of infinite trees and semantics of non deterministic recursive programs %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 181-205 %A B. Bougaut %T Algorithme explicite pour la recherche du P.G.C.D. dans certains anneaux principaux d'entiers de corps de nombres %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 207-220 %A Bernard Vauquelin %A Paul Franchi-Zannettacci %T Automates a file %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 221-225 %A M.C.B. Hennessy %A E.A. Ashcroft %T A mathematical semantics for a nondeterministic typed lambda-calculus %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 227-245 %A Hartmut Ehrig %A Barry K. Rosen %T Parallelism and concurrency of graph manipulations %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 247-275 %A Dexter Kozen %T Indexings of subrecursive classes %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 277-301 %A Norbert Blum %A Kurt Mehlhorn %T On the average number of rebalancing operations in weight-balanced trees %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 303-320 %A Joos Heintz %A Malte Sieveking %T Lower bounds for polynomials with algebraic coefficients %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 321-330 %A J. von\ zur\ Gathen %A V. Strassen %T Some polynomials that are hard to compute %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 331-335 %A Angelo Barone Netto %T There are infinitely many complete prefix codes of constant length l (L .= 3) %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 337-339 %A Mordechai Ben-Ari %T Comments on "Tautology testing with a generalized matrix reduction method" %J Theoretical Computer Science %K tcs %V 11 %D 1980 %P 341 %A Jeffrey M. Jaffe %T Efficient scheduling of tasks without full use of processor resources %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 1-17 %A N. Saheb-Djahromi %T CPO's of measures for nondeterminism %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 19-37 %A Jozef Winkowski %T Behaviours of concurrent systems %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 39-60 %A David Harel %T Proving the correctness of regular deterministic programs: a unifying survey using dynamic logic %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 61-81 %A G. Ausiello %A A. Marchetti-Spaccamela %A M. Protasi %T Toward a unified approach for the classification of NP-complete optimization problems %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 83-96 %A Louis Monier %T Evaluation and comparison of two efficient probabilistic primality testing algorithms %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 97-108 %A Maurice Mignotte %T Tests de primalite %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 109-117 %A Philip W. Grant %T Some more independence results in complexity theory %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 119-126 %A A. Ehrenfeucht %A G. Rozenberg %T On ambiguity in E0L systems %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 127-134 %A H.A. Maurer %A A. Salomaa %A D. Wood %T Synchronized E0L forms %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 135-159 %A Dana Angluin %T On counting problems and the polynomial-time hierarchy %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 161-173 %A Guy Cousineau %T An algebraic definition for control structures %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 175-192 %A John C. Beatty %T Two iteration theorems for the LL(k) languages %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 193-228 %A Jerzy Tiuryn %T Unique fixed points vs least fixed points %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 229-254 %K algebra %X It is shown that iterative algebras can be extended to partially ordered regular algebras in such a way that the iteration becomes a suitable least fixed point in the partial ordering. %A David Dobkin %A J. Ian Munro %T Determining the mode %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 255-263 %A Aravind K. Joshi %A Leon S. Levy %A Kang Yueh %T Local constraints in programming languages, part I: syntax %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 265-290 %A Derek C. Oppen %T Complexity, convexity and combinations of theories %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 291-302 %A L.G. Valiant %T Negation can be exponentially powerful %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 303-314 %A J.I. Munro %A M.S. Paterson %T Selection and sorting with limited storage %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 315-323 %A Jean Marie Boe %A Aldo de\ Luca %A Antonio Restivo %T Minimal complete sets of words %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 325-332 %A John Gill %A James Hunt %A Janos Simon %T Deterministic simulation of tape-bounded probabilistic Turing machine transducers %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 333-338 %A A. Ehrenfeucht %A G. Rozenberg %T On a bound for the D0L sequence equivalence problem %J Theoretical Computer Science %K tcs %V 12 %D 1980 %P 339-342 %A William W. Wadge %T An extensional treatment of dataflow deadlock %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 3-15 %A Nancy A. Lynch %A Michael J. Fischer %T On describing the behavior and implementation of distributed systems %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 17-43 %A Amir Pnueli %T The temporal semantics of concurrent programs %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 45-60 %A Andrea Maggiolo-Schettini %A Horst Wedde %A Jozef Winkowski %T Modeling a solution for a control problem in distributed systems by restrictions %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 61-83 %A Mogens Nielsen %A Gordon Plotkin %A Glynn Winskel %T Petri nets, event structures and domains, part I %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 85-108 %A H.J. Genrich %A K. Lautenbach %T System modeling with high-level Petri nets %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 109-136 %A Howard Straubing %T A generalization of the Schutzenberger product of finite monoids %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 137-150 %A Joseph E. Stoy %T The congruence of two programming language definitions %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 151-174 %A David Harel %T On the total correctness of nondeterministic programs %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 175-192 %A Jean H. Gallier %T Nondeterministic flowchart programs with recursive procedures: semantics and correctness I %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 193-223 %A Warren D. Goldfarb %T The undecidability of the second-order unification problem %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 225-230 %A Wolfgang Thomas %T Remark on the star-height-problem %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 231-237 %A Jean H. Gallier %T Nondeterministic flowchart programs with recursive procedures: semantics and correctness II %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 239-270 %A Erwin Engelker %T Generalized Galois theory and its application to complexity %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 271-293 %A Eitan M. Gurari %A Oscar H. Ibarra %T The complexity of the equivalence problem for two characterizations of Presburger sets %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 295-314 %A Friedhelm Meyer\ auf\ der\ Heide %T A comparison of two variations of a pebble game on graphs %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 315-322 %A Ernst Leiss %T Succinct representation of regular languages by boolean automata %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 323-330 %A Zvi Galil %A Joel Seiferas %T Linear-time string-matching using only a fixed number of local storage locations %J Theoretical Computer Science %K tcs %V 13 %D 1981 %P 331-336 %A Georg Gati %T Some elements of a Galois theory of the structure and complexity of the tree automorphism problem %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 1-17 %A Jurgen Schulte Monting %T Merging of 4 or 5 elements with n elements %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 19-37 %A Yasuaki Nishitani %A Namio Honda %T The firing squad synchronization problem for graphs %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 39-61 %A Ernst Leiss %T On generalized language equations %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 63-77 %A Arnon Rosenthal %T Optimal algorithms for sensitivity analysis in associative multiplication problems %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 69-90 %A Timothy J. Long %T On gamma-reducibility versus polynomial time many-one reducibility %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 91-101 %A Zvi Galil %T On the theoretical efficiency of various network flow algorithms %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 103-111 %A Dexter Kozen %A Rohit Parikh %T An elementary proof of the completeness of PDL %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 113-118 %A Michel Latteux %T A propos du lemme de substitution %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 119-123 %A Matthias Jantzen %T The power of synchronizing operations on strings %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 127-154 %A Jean H. Gallier %T DPDA's in "atomic normal form" and applications to equivalence problems %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 155-186 %A Joffroy Beauquier %T Substitution of semi-AFL's %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 187-193 %A Denis Therien %T Classification of finite monoids: the language approach %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 195-208 %A Akira Maruoka %A Masayuki Kimura %A Nobuyoshi Shoji %T Pattern recognition for tessalation automata %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 209-226 %A W. Bucher %A H.A. Maurer %A K. Culik,\ II %A D. Wotschke %T Concise description of finite languages %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 227-246 %A Janusz Stoklosa %A Wojciech Zakowski %T Computations of (alpha, k)-machines %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 247-265 %A G. Rozenberg %A R. Verraedt %T On pure, terminal invariant and nonterminal invariant interpretations of E0L forms %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 267-288 %A Shlomo Moran %T General approximation algorithms for some arithmetical combinatorial problems %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 289-303 %A G. Callegarin %A G. Pacini %T About the implementability and the power of equationally defined data abstractions %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 305-315 %A Kurt Jensen %T Coloured Petri nets and the invariant-method %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 317-336 %A W. Bucher %T A note on a problem in the theory of grammatical complexity %J Theoretical Computer Science %K tcs %V 14 %D 1981 %P 337-344 %A Gunther Schmidt %T Programs as partial graphs I: flow equivalence and correctness %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 1-25 %A Ronald V. Book %T Bounded query machines: on NP and PSPACE %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 27-39 %A Ronald V. Book %A Celia Wrathall %T Bounded query machines: on NP() and NPQUERY() %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 41-50 %A Toshiro Araki %A Toyohiko Kagimasa %A Nobuki Tokura %T Relations of flow languages to Petri net languages %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 51-75 %A Daniel Lazard %T Resolution des systemes d'equations algebriques %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 77-110 %A Charles E. Hughes %A Stanley M. Selkow %T The finite power property for context-free languages %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 111-114 %A Stephan Heilbrunner %T A parsing automata approach to LR theory %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 117-157 %A Gunther Schmidt %T Programs as partial graphs II: recursion %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 159-179 %A L.H. Landweber %A R.J. Lipton %A E.L. Robertson %T On the structure of sets in NP and other complexity classes %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 181-200 %A A. Alder %A V. Strassen %T On the algorithmic complexity of associative algebras %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 201-211 %A Giorgio Germano %A Andrea Maggiolo-Schettini %T Sequence recursiveness without sylindrification and limited register machines %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 213-221 %A James W. Thatcher %A Eric G. Wagner %A Jesse B. Wright %T More on advice on structuring compilers and proving them correct %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 223-249 %K algebra, semantics %A A. Paz %A S. Moran %T Non deterministic polynomial optimization problems and their approximations %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 251-277 %A E.W. Leggett,\ Jr. %A Daniel J. Moore %T Optimization problems and the polynomial hierarchy %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 279-289 %A Howard P. Katseff %A Michael Sipser %T Several results in program size complexity %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 291-309 %A Michael C. Loui %T A spce bound for one-tape multidimensional Turing machines %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 311-320 %A C. Benzaken %A S. Foldes %T Complexity of graph embeddability problems %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 321-328 %A R. Statman %T On the existence of closed terms in the typed lambda-calculus II: %J Theoretical Computer Science %K tcs %V 15 %D 1981 %P 329-338 %A K. Weihrauch %A Ulrich Schreiber %T Embedding metric spaces into CPO's %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 5-24 %A A. Ehrenfeucht %A G. Rozenberg %T On the subword complexity of square-free D0L languages %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 25-32 %A Ju.M. Vazenin %T Sur la liaison entre problemes combinatoires et algorithmiques %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 33-41 %A Saturo Takasu %A Sukemitsu Kawabata %T A logical basis for programming methodology %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 43-60 %A Matthias Jantzen %T On a special monoid with a single defining relation %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 61-73 %A Janos Simon %T On tape-bounded probabilstic Turing machine acceptors %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 75-91 %A Michael G. Main %A David B. Benson %T Free upper regular bands %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 93-98 %A Karl Lieberherr %T Uniform complexity and digital signatures %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 99-110 %A Ren-ji Tao %T On the computational power of automata with time or space bounded by Ackermann's of superexponential functions %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 115-148 %A Jan Pittl %T On LLP(k) grammars and languages %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 149-175 %A G. Galbiati %A M.J. Fischer %T On the complexity of 2-output boolean networks %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 177-185 %A Kari-Jouko Raiha %A Esko Ukkonen %T The shorest common supersequence problem over binary alphabet is NP-complete %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 187-198 %A L. Csirmaz %T Programs and program verifications in a general setting %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 199-210 %A V.L. Nguyen %A J.L. Lassez %T A dual problem to least fixed points %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 211-221 %A Ronald V. Book %A Colm P. O'Dunlaing %T Testing for the Church-Rosser property %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 223-229 %A J. Lawrence Carter %T A note on the existence of continuous functionals %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 231-235 %A H.C.M. Kleijn %A G. Rozenberg %T Context-free like restrictions on selective rewriting %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 237-269 %A K. Lam %A M.K. Siu %A C.T. Yu %T A generalized counter scheme %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 271-278 %A Walter A. Burkhard %A Michael L. Fredman %A Daniel J. Kleitman %T Inherent complexity trade-offs for range query problems %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 279-290 %A J. Albert %A L. Wegner %T Languages with homomorphic replacements %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 291-305 %A U.I. Gupta %A D.T. Lee %A J.Y.-T. Leung %A J.W. Pruitt %A C.K. Wong %T Record allocation for minimizing seek delay %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 307-319 %A Francine Berman %A Michael Paterson %T Propositional dynamic logic is weaker without tests %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 321-328 %A H. Edelsbrunner %A H.A. Maurer %T A space-optimal solution of general region location %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 329-336 %A Jean-Pierre Pecuchet %T Sur la determination du rang d'une equation dans le monoide libre %J Theoretical Computer Science %K tcs %V 16 %D 1981 %P 337-340 %A Meera Blattner %A Seymour Ginsburg %T Position-restricted grammar forms and grammars %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 1-27 %A E. Welzl %T Color-families are dense %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 29-41 %A Esko Ukkonen %T Structure preserving elimination of null productions from context-free grammars %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 43-54 %A Eitan M. Gurari %A Oscar H. Ibarra %T Some simplified undecidable and NP-hard problems for simple programs %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 55-73 %A J. Hartmanis %T A note on natural complete sets and Godel numberings %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 75-89 %A Maciej M. Syslo %T The subgraph isomorphism problem for outerplanar graphs %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 91-97 %A Marek Karpinski %T Decidability of "Skolem matrix emptiness problem" entail constructibility of exact regular expression %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 99-102 %A W.D. Fellner %T On minimal graphs %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 103-110 %A J.A. Bergstra %A J. Tiuryn %A J.V. Tucker %T Floyd's principle. correctness theories and program equivalence %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 113-149 %A Daniel Lehmann %A Ana Pasztor %T Epis need not be dense %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 151-161 %A Bruno Courcelle %A Paul Franchi-Zannettacci %T Attribute grammars and recursive program schemes I %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 163-191 %A H. Andreka %A I. Nemeti %A I. Sain %T A complete logic for reasoning about programs via nonstandard model theory I %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 193-212 %A Ronald D. Dutton %A Robert C. Brigham %T The complexity of a multiprocessor task assignment problem without deadlines %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 213-216 %A John C. Shepherdson %T Graph theoretic characterization of G-schemes and FL-schemes %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 217-228 %A Craig Squier %A C. Wrathall %T A note on representations of a certain monoid %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 229-231 %A Bruno Courcelle %A Paul Franchi-Zannettacci %T Attribute grammars and recursive program schemes II %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 235-257 %A H. Andreka %A I. Nemeti %A I. Sain %T A complete logic for reasoning about programs via nonstandard model theory II %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 259-278 %A Nachum Dershowitz %T Orderings for term-rewriting systems %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 279-301 %A J.A. Bergstra %A J.V. Tucker %T Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 303-315 %A Fereidoon Sadri %A Jeffrey D. Ullman %T The theory of functional and template dependencies %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 317-331 %A R.K. Syamasundar %T On a characterization of pushdown permuters %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 333-341 %A Istvan Nemeti %T Every free algebra in the variety generated by the representable dynamic algebras is separable and representable %J Theoretical Computer Science %K tcs %V 17 %D 1982 %P 343-347 %A C. Pair %T Abstract data types and algebraic semantics of programming languages %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 1-31 %A Jonathan Goldstine %A John K. Price %A Detlef Wotchke %T A pushdown automaton or a context-free grammar - which is more economical ? %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 33-40 %A A.P. Ershov %T Mixed computation: potential applications amd problems for study %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 41-67 %A J. Hagauer %T On form-equivalence of deterministic pure grammar forms %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 69-87 %A Georg Schnitger %T A family of graphs with expensive depth-reduction %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 89-93 %A Uwe Schoning %T A uniform approach to obtain diagonal sets in complexity classes %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 95-103 %A Martin Furer %T The complexity of Presburger arithmetic with bounded quantifier alternation depth %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 105-111 %A J. Berstel %A C. Reutenauer %T Recognizable formal power series on trees %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 115-148 %A E. Best %T Adequacy properties of path programs %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 149-171 %A F. Boussinot %T Proposition de semantique denotationelle pour des reseaux de processus avec operateur de melange equitable %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 173-206 %A Keisuke Uchimura %T Properties of structure generating functions of automata and their applications for linear systems %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 207-220 %A Max Crochemore %T Sharp characterizations of squarefree morphisms %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 221-226 %A Joseph Sifakis %T A unified approach for studying the properties of transition systems %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 227-258 %A Daniel Leivant %T Unprovability of theorems of complexity theory in weak number theories %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 259-268 %A Akira Maruoka %A Masayuki Kimura %T Strong surjectivity is equivalent to C-injectivity %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 269-277 %A Karel Culik,\ II %A Tero Harju %T Dominoes over a free monoid %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 279-300 %A Albert R. Meyer %A Karl Winklmann %T Expressing program loopong in regular dynamic logic %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 301-323 %A Ronald V. Book %T When is a monoid a group ? The Church-Rosser case is tractable %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 325-331 %A Sorin Istrail %T Generalization of the Ginsburg-Rice-Schutzenberger fixed-point theorem for context-sensitive and recursively-enumerable languages %J Theoretical Computer Science %K tcs %V 18 %D 1982 %P 333-341 %A Y. Perl %A S. Zaks %T On the complexity of edge labelings for trees %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 1-16 %A Oscar H. Ibarra %A Brian S. Leininger %A Shlomo Moran %T On the complexity of simple arithmetic expressions %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 17-28 %A Karel Culik,\ II %A Arto Salomaa %T On infinite words obtained by iterating morphisms %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 29-38 %A D.Yu. Grigor'ev %T Additive complexity in directed computations %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 39-67 %A Ravi Sethi %T Pebble games for studying storage sharing %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 69-84 %A A. Cardon %A M. Crochemore %T Partitioning a graph in O(|A| log2 |V|) %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 85-98 %A M. Holcombe %T On the holonomy decomposition transformation semigroups %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 99-104 %A T. Ito %A Y. Hishitani %T On universality of concurrent expressions with synchronization primitives %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 105-115 %A Peter Padawitz %T Graphs grammars and operational semantics %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 117-141 %A J. Paredaens %T A universal formalism to express decompositions, functional dependencies and other constraints in a relational database %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 143-160 %A Harry R. Lewis %A Christos Papadimitriou %T Symmetric space-bounded computation %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 161-187 %A Greg N. Frederickson %A Joseph Ja'Ja' %T On the relationship between the biconnectivity augmentation and traveling salesman problems %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 189-201 %A Andrew Chi-Chih Yao %T On the time-space tradeoff for sorting with linear queries %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 203-218 %A Oscar H. Ibarra %T 2DST mappings on languages and related problems %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 219-227 %A Ronald V. Book %A Matthias Jantzen %A Celia Wrathall %T Monadic Thus systems %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 231-251 %A K. Rudiger Reischuk %T A fast implementation of a multidimensional storage into a tree storage %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 253-266 %A Paolo Atzeni %A Giorgio Ausiello %A Carlo Batini %A Marina Moscarini %T Inclusion and equivalence between relational database schemata %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 267-285 %A Alan L. Selman %T Reductions on NP and P-selective sets %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 287-304 %A Helge Szwerinski %T Time-optimal solution of the firing-squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 305-320 %A Marc Snir %T Comparisons between linear functions can help %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 321-330 %A Bernard R. Hodgson %T On direct products of automaton decidable theories %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 331-335 %A Nimrod Megiddo %T Is banry encoding appropriate for the problem-language relationship ? %J Theoretical Computer Science %K tcs %V 19 %D 1982 %P 337-341 %A Mitchell Wand %T Specifications, models, and implementations of data abstractions %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 3-32 %A A. Arnold %A M. Dauchet %T Morphismes et bimorphismes d'arbres %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 33-93 %A Werner Damm %T The IO- and OI-hierarchies %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 95-207 %A H. Ehrig %A H.-J. Kreowski %A B. Mahr %A P. Padawitz %T Algebraic implementation of abstract data types %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 209-263 %A G. Berry %A P.L. Curien %T Sequential algorithms on concrete data structures %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 265-321 %A Ker-I Ko %A Harvey Friedman %T Computation complexity of real functions %J Theoretical Computer Science %K tcs %V 20 %D 1982 %P 323-352 %A Timothy J. Long %T Strong nondeterministic polynomial-time reducibilities %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 1-25 %A Satoru Miyano %T Two-way deterministic multi-weak-counter machines %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 27-37 %A Pavol Duris %A Zvi Galil %T Fooling a two way automaton or one pushdown store is better than one counter for two-way machines %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 39-53 %A D. Janssens %A G. Rozenberg %T Graph grammars with neighbourhood-controlled embedding %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 55-74 %A A. Ehrenfeucht %A G. Rozenberg %T Representation theorems using DOS languages %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 75-90 %A Robert Cori %A Antonio Machi %T Construction of maps with prescribed automorphism group %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 91-98 %A X. Berenguer %A J. Diaz %A L.H. Harper %T A solution of the Sperner-Erdos problem %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 99-103 %A Leslie M. Goldshlager %A Ralph A. Shaw %A John Staples %T The maximum flow problem is log space complete for P %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 105-111 %A A. Ehnrenfeucht %A J. Karhumaki %A G. Rozenberg %T The (generalized) Post correspondence problem with lists consisting of two words is decidable %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 119-144 %A Michael C. Loui %T Simulations among multidimensional Turing machines %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 145-161 %A W. Ainhirn %T Marvellous interpretations differ little bu decisively from ordinary interpretations of EOL forms %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 163-178 %A Bogdan S. Chlebus %T On the computational complexity of satisfiability in propositional logics of programs %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 179-212 %A Ingo Wegener %T Boolean functions whose monotone complexity is of size n^2/log n %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 213-224 %A Stuart W. Margolis %T On the syntactic transformation semigroup of the language generated by a finite biprefix code %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 225-230 %A L. Csirmaz %T Determinateness of program equivalence over Peano axioms %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 231-235 %A Burkhard Monien %A Ivan Hal Sudborough %T On eliminating nondeterminism from Turing machines which use less than logarithm worktape space %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 237-253 %A Clement F. Kent %A Bernard R. Hodgson %T An arithmetical characterization of NP %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 255-267 %A J.A. Bergstra %A J.-J.Ch. Meyer %T On the elimination of iteration quantifiers in a fragment of algorithmic logic %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 269-279 %A K. Indermark %T On rational definitions in incomplete algebras without rank %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 281-313 %A Jozef Winkowski %T An algebraic description of system behaviours %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 315-340 %A Sorin Istrail %T Some remarks on non-algebraic adherences %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 341-349 %A Petr Kurka %T Ergodic languages %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 351-355 %A Tom Head %A John Wilkinson %T Finite DOL languages and codes %J Theoretical Computer Science %K tcs %V 21 %D 1982 %P 357-361 %A Roger Hindley %T The completeness theorem for typing lambda terms %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 1-17 %K lambda calculus %X complete rules for assigning type-schemes to untyped lambda-terms %A Masahiko Sato %T Theory of symbolic expressions, I %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 19-55 %A Jan Pittl %A Amiram Yehudai %T Constructing a realtime deterministic pushdown automaton from a grammar %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 57-69 %A Peter Gacs %T On the relation between descriptional complexity and algorithmic probability %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 71-93 %A W. Kuich %A F.J. Urbanek %T Infinite linear systems and one counter languages %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 95-126 %A Roger Hindley %T Curry's type-rules are complete with respect to the F-semantics too %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 127-133 %A Gerard Boudol %A Laurent Kott %T Recursion induction principle revisited %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 135-173 %A Minoru Ito %A Kenichi Taniguchi %A Tadao Kasami %T Membership problem for embedded multivalued dependencies under some restricted conditions %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 175-194 %A G.W. Wasilkowski %T ANy iteration for polynomial equations using linear information has infinite complexity %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 195-208 %A D.T. Lee %A C.L. Liu %A C.K. Wong %T (g0, g1, ..gk)-trees and unary 0L systems %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 209-217 %A Magnus Steinby %T Systolic trees and systolic language recognition by tree automata %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 219-232 %A G. Lev %A L.G. Valiant %T Size bounds for superconcentrators %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 233-251 %A Masako Takahashi %T Nest sets and relativized closure properties %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 253-264 %A J.A. Bergstra %A J.V. Tucker %T Hoare's logic and Peano's arithmetic %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 265-284 %A A. Lempel %A G. Seroussi %A S. Winograd %T On the complexity of multiplication in finite fields %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 285-296 %A A. Apostolico %A F.P. Preparata %T Optimal off-line detection of repetitions in a string %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 297-315 %A Walter Baur %A Volker Strassen %T The complexity of partial derivatives %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 317-330 %A H.A. Maurer %A A. Salomaa %A D. Wood %T L codes and number systems %J Theoretical Computer Science %K tcs %V 22 %D 1983 %P 331-346 %A Chang-jie Tang %A Yi-li Zhang %T The limited regular languages %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 1-10 %A Andrzej Jankowski %A Cecylia Rauszer %T Logical foundation approach to users' domain restriction in data bases %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 11-36 %A Akira Nakamura %A Hiroakira Ono %T Pictures of functions and their acceptability by automata %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 37-48 %A Stephan Heilbrunner %T A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 49-68 %A Franz-Josef Brandenburg %T Uniformly growing k-th power-free homomorphisms %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 69-82 %A Tom Head %A G. Thierrin %A J. Wilkinson %T DOL schemes and the periodicity of string embeddings %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 83-89 %A Anton Nijholt %T On satisfying the LL-iteration theorem %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 91-94 %A Tat-hung Chan %A Oscar H. Ibarra %T On the finite-valuedness problem for sequential machines %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 95-101 %A Prakash V. Ramanan %T A counterexample to Shyamasundar's characterization of pushdown permuters %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 103-105 %A Erol Gelenbe %T Stationary deterministic flows in discrete systems I %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 107-127 %K Petri nets %A Etsuji Tomita %T A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 129-154 %A Gerald S. Eisman %T On depth in EDTOL languages %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 155-169 %A Grazia Lotti %A Francesco Romani %T On the asymptotic complexity of rectangular matrix multiplication %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 171-185 %A R.J.R. Back %T A continuous semantics for unbounded nondeterminism %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 187-210 %A James Finn %A Karl Liberherr %T Primality testing and factoring %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 211-215 %A Kasako Takahashi %A Hideki Yamasaki %T A note on omega-regular languages %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 217-225 %A K. Culik,\ II %A J. Gruska %A A. Salomaa %T On a family of L languages resulting from systolic tree automata %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 231-242 %A Tuvi Etzion %A Michael Yoeli %T Super-nets and their hierarchy %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 243-272 %K Petri nets %A Alberto Marchetti-Spaccamela %A Marco Protasi %T The largest tree in a random graph %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 273-286 %A Rudolf Freund %T Real functions and numbers defined by Turing machines %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 287-304 %A Dan Grdon %A Eliahu Shamir %T Computation of recursive functionals using minimal initial segments %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 305-315 %A Tsutomu Kamimura %A Adrian Tang %T Kleene chain completeness and fixedpoint properties %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 317-331 %A Hugo Volger %T Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 333-337 %A Colm O'Dunlaing %T Undecidable questions related to Church-Rosser Thue systems %J Theoretical Computer Science %K tcs %V 23 %D 1983 %P 339-345 %A Horst Wedde %T An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 1-20 %A Aldo de\ Luca %A Antonio Restivo %A Sergio Salemi %T On the centers of a language %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 21-34 %A Oscar H. Ibarra %A Shlomo Moran %A Louis E. Rosier %T On the control power of integer division %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 35-52 %A John J. Grefenstette %T Stability in L systems %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 53-71 %A David A. Schmidt %T Approximation properties of abstract data types %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 73-94 %A Robert P. Daley %T On the error correcting power of pluralism in BC-type inductive inference %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 95-104 %A Osamu Watanabe %T The time-precision tradeoff problem on on-line probabilistic Turing machines %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 105-117 %A Bernard Chazelle %A Louis Monier %T Unbounded hardware is equivalent to deterministic Turing machines %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 123-130 %A N. Soundararajan %T Correctness proofs of CSP programs %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 131-141 %A K.K. Nambiar %A T. Radhakrishnan %A V.G. Tikekar %T Representation of functional dependencies in relational databases using linear graphs %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 143-159 %A Akira Nakamura %A Kunio Aizawa %T On a relationship between graph L-systems and picture languages %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 161-177 %A Manabu Toda %A Katsushi Inoue %A Itsuo Takanami %T Two-dimensional pattern matching by two-dimensional on-line tessalation acceptors %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 179-194 %A Rani Siromoney %A V. Rajkumar Dare %A K.G. Subramanian %T Infinite arrays and infinite computations %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 195-205 %A A. Bagchi %A A. Mahanti %T Admissible heuristic search in AND/OR graphs %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 207-219 %A James A. Storer %T Toward an abstract theory of data compression %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 221-237 %A Joos Heintz %T Definability and fast quantifier elimination in algebraically closed fields %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 239-277 %A Steven Homer %A Wolfgang Maass %T Oracle-dependent properties of the lattice of NP sets %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 279-289 %A Umesh V. Vazirani %A Vijay V. Vazirani %T A natural encoding scheme proved probabilistic polynomial complete %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 291-300 %A Ronald V. Book %T Decidable sentences of Church-Rosser congruences %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 301-312 %A Oscar H. Ibarra %T On some decision questions concerning pushdown machines %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 313-322 %A Patrick C. Fischer %A J.H. Jou %A D.-M. Tsou %T Succinctness in dependency systems %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 323-329 %A Katsushi Inoue %A Itsuo Takanami %A Hiroshi Taniguchi %T A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 331-336 %A Ernst-Rudiger Olderog %T On the notion of expressiveness and the rule of adaptation %J Theoretical Computer Science %K tcs %V 24 %D 1983 %P 337-347 %A A.J. Kfoury %T Definability by programs in first-order structures %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 1-66 %A Evelyn Nelson %T Iterative algebras %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 67-94 %A Bruno Courcelle %T Fundamental properties of infinite trees %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 95-169 %A Colm O'Dunlaing %T Infinite regular Thue systems %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 171-192 %A John Case %A Carl Smith %T Comparison of identification criteria for machine inductive inference %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 193-220 %A Lutz Priese %T Automata and concurrency %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 221-265 %K Petri nets %A Robin Milner %T Calculi for synchrony and asynchrony %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 267-310 %A Rudiger Valk %T Infinite behaviour of Petri nets %J Theoretical Computer Science %K tcs %V 25 %D 1983 %P 311-341 %A E.B. Kinber %T The inclusion principle for some classes of deterministic multitape automata %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 1-24 %A Ivan Hal Sudborough %T Bandwidth constraints on problems complete for polynomial time %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 25-52 %A J.W. de\ Bakker %A J.-J.Ch. Meyer %A J.I. Zucker %T On infinite computations in denotational semantics %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 53-82 %A S. Istrail %A C. Masalagiu %T Nivat's processing systems: decision problems related to protection and synchronization %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 83-103 %A E.C.R. Hehner %A C.A.R. Hoare %T A more complete model of communicating processes %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 105-120 %A E. Allen Emerson %T Alternative semantics for temporal logics %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 121-130 %A K. Weihrauch %A G. Schafer %T Admissible representations of effective CPO's %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 131-147 %A Seymour Ginsburg %A Richard Hull %T Order dependency in the relational model %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 149-195 %A Oscar H. Ibarra %A Louis E. Rosier %T Simple programming languages and restricted classes of Turing machines %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 197-220 %A Andre Arnold %T Rational omega-languages are non-ambiguous %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 221-223 %A Vaclav Rajlich %T Determinism in parallel systems %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 225-231 %A W. Bucher %A J. Hagauer %T It is decidable whether a regular language is pure context-free %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 233-241 %A Seymour Ginsburg %A Richard Hull %T Characterizations for functional dependency and Boyce-Codd normal form families %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 243-286 %A Chee K. Yap %T Some consequences of non-uniform conditions on uniform classes %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 287-300 %A G. Rozenberg %A R. Verraedt %T Subset languages of Petri nets, part I: the relationship to string languages and normal forms %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 301-326 %A Stanislaw Zak %T A turing machine time hierarchy %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 327-333 %A J. Hartmanis %T On Godel speed-up and succinctness of language representations %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 335-342 %A John Staples %A V.L. Nguyen %T Computing the behaviour of asynchronous processes %J Theoretical Computer Science %K tcs %V 26 %D 1983 %P 343-353 %A H.B. Hunt,\ III %A D.J. Rosenkrantz %T The complexity of monadic recursion schemes: executability problems, nesting depth, and applications %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 3-38 %A Tsutomu Kamimura %A Adrian Tang %T Algebraic relations and presentations %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 39-60 %A Katsushi Inoue %A Itsuo Takanami %A Hiroshi Taniguchi %T Two-dimensional alternating Turing machines %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 61-83 %A G. Rozenberg %A R. Verraedt %T Subset languages of Petri nets part II: closure properties %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 85-108 %A Michael B. Smyth %T The largest Cartesian closed category of domains %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 109-119 %A Pavol Duris %A Juraj Hromkovic %T One-way simple multihead finite automata are not closed under concatenation %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 121-125 %A Joseph Y. Halpern %A John H. Reif %T The propositional dynamic logic of deterministic, well-structured programs %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 127-165 %A Hans-Dieter Ehrich %A Udo Lipeck %T Algebraic domain equations %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 167-196 %A A.P. Stolboushkin %A M.A. Taitslin %T The comparison of the expressive power of first-order dynamic logics %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 197-209 %A Symeon Bozapalidis %A Olympia Louscou-Bozapalidou %T The rank of a formal tree power series %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 211-215 %A Akira Maruoka %T Open maps for tessellation automata %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 217-224 %A Jiri Adamek %A Evelyn Nelson %T Separately continuous algebras %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 225-231 %A David P. Dobkin %A David G. Kirkpatrick %T Fast detection of polyhedral intersection %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 241-253 %A H. Ehrig %A H.-J. Kreowski %T Compatibility of parameter passing and implementation of parameterized data types %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 255-286 %A Norbert Blum %T More on the power of chain rules in context-free grammars %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 287-295 %A R.D. Tennet %T Semantics of interference control %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 297-310 %A A. Ehrenfeucht %A D. Haussler %A G. Rozenberg %T On regularity of context-free languages %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 311-332 %A Dexter Kozen %T Results on the propositional mu-calculus %J Theoretical Computer Science %K tcs %V 27 %D 1983 %P 333-354 %A W. Paul %T On heads versus tapes %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 1-12 %A Jan Maluszynski %T Towards a programming language based on the notion of two-level grammar %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 13-43 %A Hartmut Ehrig %A Hans-Jorg Kreowski %A James Thatcher %A Eric Wagner %A Jesse Wright %T Parameter passing in algebraic specification languages %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 45-81 %A Krzysztof R. Apt %T Ten years of Hoare's logic: a survey - part II: nondeterminism %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 83-109 %A R. Weihagen %A R. Freivalds %A E.B. Kinber %T On the power of probabilistic strategies in inductive inference %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 111-133 %A Dario Bini %T On commutativity and approximation %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 135-150 %A S. Ronchi\ della\ Rocca %A B. Venneri %T Principal type schemes for an extended type theory %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 151-169 %A C. Fernandez %A P.S. Thiagarajan %T D-continuous causal nets: a model of non-sequential processes %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 171-196 %K Petri nets %A A. Ehrenfeucht %A G. Rozenberg %A A. Verraedt %T On inherently ambiguous E0L languages %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 197-214 %A J.A. Bergstra %A J.V. Tucker %T Hoare's logic for programming languages with two data types %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 215-221 %A Taiho Kanaoka %A Shingo Tomita %T The decomposition of stochastic systems %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 223-233 %A J. Roger Hindley %T Coppo-Dezani types do not correspond to propositional logic %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 235-236 %A P.T. Cox %A T. Pietrzykowski %T A complete, nonredundant algorithm for reversed skolemization %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 239-261 %A David Kirkpatrick %A Stefan Reisch %T Upper bounds for sorting integers on random access machines %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 263-276 %A W. Bucher %A H.A. Maurer %A K. Culik,\ II %T Context-free complexity of finite languages %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 277-285 %A Francesco Parisi-Presicce %T Iterative factor algebras and induced metrics %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 287-298 %A Alica Kelemenova %T Complexity of normal form grammars %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 299-314 %A Kojiro Kobayashi %A Masako Takahashi %A Hideki Yamasaki %T Characterization pf omega-regular languages by first-order formulas %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 315-327 %A Dominique Perrin %T Completing biprefix codes %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 329-336 %A Norbert Blum %T A boolean function requiring 3n network size %J Theoretical Computer Science %K tcs %V 28 %D 1984 %P 337-345 %A J.F. Traub %A G.W. Wasilowski %T Average case optimality for linear problems %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 1-25 %A Ewa Orlowska %A Zdlislaw Pawlak %T Representation of nondeterministic information %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 27-39 %A G. Rozenberg %A R. Verraedt %T On simulation and propagating E0L forms %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 41-48 %A Aviezri S. Fraenkel %T Wythoff games, continued fractions, cedar trees and Fibonacci searches %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 49-73 %A Greg N. Frederickson %T Recursively rotated orders and implicit data structures: a lower bound %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 75-85 %A Ryszard Janicki %T Nets, sequential components and concurrency relations %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 87-121 %K Petri nets %A Oscar H. Ibarra %A Sam M. Kim %T Characterizations and computational complexity of systolic trellis automata %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 123-153 %A Tsutomu Kamimura %A Adrian Tang %T Effectively given spaces %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 155-166 %A J.-L. Lassez %A M.J. Maher %T Closures and fairness in the semantics of programming logic %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 167-184 %A E. Fachini %A M. Napoli %T Hierarchies of primitive recursive wordsequence functions: comparison and decision problems %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 185-227 %A Tzilla Elrad %A Nissim Francez %T A weakest precondition semantics for communicating processes %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 231-250 %A Marisa Venturini\ Zilli %T Reduction graphs in the lambda calculus %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 251-275 %A D.H. Potts %T Remarks on an example of Jantzen %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 277-284 %A Juhani Karhumaki %T The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 285-308 %A Mario Coppo %T Completeness of type assignment in continuous lambda models %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 309-324 %A Gerald S. Eisman %T On the ratio of growth functions in EDT0L languages %J Theoretical Computer Science %K tcs %V 29 %D 1984 %P 325-349 %A J.A. Bergstra %A J.W. Klop %T Proving program inclusion using Hoare's logic %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 1-48 %A Ernst-Rudiger Olderog %T Correctness of programs with Pascal-like procedures without global variables %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 49-90 %A Didier Austry %A Gerard Boudol %T Algebre de processus et synchronisation %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 91-131 %A Robert de\ Simone %T On MEIJE and SCCS: infinite sum operators vs. non-guarded definitions %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 135-138 %A Herbert A. Klaeren %T A constructive method for abstract algebraic software specification %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 139-204 %A J.P. Braquelaire %A B. Courcelle %T The solutions of two star-height problems for regular trees %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 205-239 %A H.J. Genrich %A P.S. Thiagarajan %T A theory of bipolar synchronization schemes %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 241-318 %K Petri nets %A Larry Denenberg %A Harry R. Lewis %T The complexity of the satisfiability problem for Krom formulas %J Theoretical Computer Science %K tcs %V 30 %D 1984 %P 319-341 %A Hideki Yamasaki %A Masako Takahashi %T Generalized parenthesis languages and minimization of their parenthesis parts %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 1-11 %A N. Soundararajan %T A proof technique for parallel programs %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 13-29 %A Kim Bruce %A Giuseppe Longo %T On combinatory algebras and their expansions %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 31-40 %A Uwe Schoning %T Minimal pairs for P %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 41-48 %A B. Mahr %A J.A. Makowsky %T Characterizing specification languages which admit initial semantics %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 49-59 %A Juha Honkala %T Bases and ambiguity of number systems %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 61-71 %A D. Frutos\ Escrig %T A characterization of Plotkin's order in powerdomains, and some of its properties %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 73-82 %A Robert de\ Simone %T Langages infinitaires et produit de mixage %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 83-100 %A Ker-I Ko %T Reducibilities on real numbers %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 101-123 %A David A. Plaisted %T New NP-hard and NP-complete polynomial and integer divisibility problems %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 125-138 %A Tom Head %T Adherences of D0L languages %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 139-149 %A Mohamed Mezghiche %T Une novelle Cbeta-reduction dans la logique combinatoire %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 151-163 %A Paliath Narendran %A Robert McNaughton %T The undecidability of the preperfectness of Thue systems %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 165-174 %A J.A. Goguen %A R.M. Burstall %T Some fundamental algebraic tools for the semantics of computation part 1: comma categories, colimits, signatures and theories %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 175-209 %A Andrzej Ehrenfeucht %A Michael G. Main %A Grzerorz Rozenberg %T Restrictions on NLC graph grammars %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 211-223 %A Keisuke Uchimura %T Truncations of infinite matrices and algebraic series associated with some CF grammars %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 227-261 %A J.A. Goguen %A R.M. Burstall %T Some fundamental algebraic tools for the semantics of computation part 2: signed and abstract theories %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 263-295 %A H. Alaiwan %T Equivalence of infinite behavior of finite automata %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 297-306 %A Hideki Yamasaki %T Normal Petri nets %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 307-315 %A Michio Oyamaguchi %T Some results on subclass containment problems for special classes of DPDA's related to nonsingular machines %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 317-335 %A Jean-Michel Autebert %A Joffroy Beauquier %A Luc Boasson %A Geraud Senizergues %T Remarques sur les langages de parentheses %J Theoretical Computer Science %K tcs %V 31 %D 1984 %P 337-349 %A Jean Claude Raoult %T On graph rewritings %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 1-24 %A N. Francez %A D. Lehmann %A A. Pnueli %T A linear-history semantics for languages for distributed programming %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 25-46 %A J. Duske %A R. Parchmann %T Linear indexed languages %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 47-60 %A J. Avenhaus %A K. Madlener %T The Nielsen reduction and P-complete problems in free groups %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 61-76 %A Francis Y. Chin %A Peter Kossowski %A S.C. Loh %T Efficient inference control for range sum queries %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 77-86 %A Etsuji Tomita %T An extended directed branching algorithm for checking equivalence of deterministic pushdown automata %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 87-120 %A E. Astesiano %A G. Costa %T Distributive semantics for nondeterministic typed lambda calculi %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 121-156 %A Uzi Vishkin %T A parallel-design distributed-implementation (PDDI) general-purpose computer %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 157-172 %A Kenneth McAloon %T Petri nets and large finite sets %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 173-183 %A David Maier %A Jeffrey D. Ullman %T Connections in acyclic hypergraphs %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 185-199 %A T.E. Hall %T Biprefix codes, inverse semigroups and syntactic monoids of injective automata %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 201-213 %A Roy Meshulam %T A geometric construction of a superconcentrator of depth 2 %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 215-219 %A Jia-Wei Hong %T A tradeoff theorem for space and reversal %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 221-224 %A Karel Culik,\ II %A Sheng Yu %T Iterative tree automata %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 227-247 %A Friedrich Otto %T Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 249-260 %A Valtteri Niemi %T The undecidability of form equivalence for context-free and E0L forms %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 261-277 %A J. Avenhaus %A K. Madlener %T On the complexity of intersection and conjugacy problems in free groups %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 279-295 %A Jussi Ketonen %A Richard Weyhrauch %T A decidable fragment of predicate calculus %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 297-307 %A N.G. de\ Bruijn %T Some machines defined by directed graphs %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 309-319 %A Satoru Miyano %A Takeshi Hayashi %T Alternating finite automata on omega-words %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 321-330 %A Ludwig Staiger %T Projection lemmas for omega-languages %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 331-337 %A Gerard Jacob %A Christophe Reutenauer %T On formal power series defined by infinite linear systems %J Theoretical Computer Science %K tcs %V 32 %D 1984 %P 339-340 %A Rani Siromoney %A K.G. Subramanian %A V. Rajkumar Dare %T Infinite arrays and controlled deterministic table 0L array systems %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 3-11 %A Matthias Jantzen %A Manfred Kudlek %T Homomorphic images of sentential form languages defined by semi-Thue systems %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 13-43 %A Egidio Astesiano %A Elena Zucca %T Parametric channels via label expressions in CCS %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 45-63 %A K.R. Apt %A A. Pnueli %A J. Stavi %T Fair termination revisited - with delay %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 65-84 %A B. Ravikumar %A K.B. Lakshmanan %T Coping with known patterns of lies in a search game %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 85-94 %A Peter Dybjer %T Some results on the deductive structure of join dependencies %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 95-105 %A C.E. Veni\ Madhavan %T Secondary attribute retrieval using tree data structures %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 107-116 %A V.Ya. Pan %T The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 117-138 %A M. Broy %A M. Wirsing %A C. Pair %T A systematic study of models of abstract data types %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 139-174 %A Stephane Kaplan %T Conditional rewrite rules %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 175-193 %A Elfriede Fehr %T Expressive power of types and type-free programming languages %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 195-238 %A Yael Maon %A Amiram Yehudai %T On test sets for checking morphism equivalence on languages with fair distribution of letters %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 239-260 %A Friedrich Otto %T Some undecidability results for non-monadic Church-Rosser Thue systems %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 261-278 %A N. Soundararajan %T Denotational semantics of CSP %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 279-304 %A Dung T. Huynh %T Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is SIGMA(p, 2)-complete %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 305-326 %A Tero Harju %A Matti Linna %T The equations h(w)=w^n in binary alphabets %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 327-329 %A Dominique Perrin %A Paul Schupp %T Sur les monoides a un relateur qui sont des groupes %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 331-334 %A Daniele Girault-Beauquier %T Bilimites de langages reconnaissables %J Theoretical Computer Science %K tcs %V 33 %D 1984 %P 335-342 %A Jaroslav Nesetril %T Some nonstandard Ramsey like applications %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 3-15 %A J. Hartmanis %A Y. Yesha %T Computation times of NP sets of different densities %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 17-32 %A Glynn Winskel %T Synchronization trees %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 33-82 %A R. de\ Nicola %A M.C.B. Hennessy %T Testing equivalences for processes %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 83-133 %A J.W. de\ Bakker %A J.A. Bergstra %A J.W. Klop %A J.-J.Ch. Meyer %T Linear time and branching time semantics for recursion with merge %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 135-156 %A Paul M.B. Vitanyi %T On the simulation of many storage heads by one %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 157-168 %A Marie-Pierre Delest %A Gerard Viennot %T Algebraic languages and polyominoes enumeration %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 169-206 %A A.K. Lenstra %T Factoring multivariate intergal polynomials %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 207-213 %A Shimon Cohen %A Daniel Lehmann %T Symmetric and economical solutions to the mutual exclusion problem in a distributed system %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 215-225 %A Taisuke Sato %A Hisao Tamaki %T Enumeration of success patterns in logic programs %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 227-240 %A M. Clerbout %A M. Latteux %T Partial commutations and faithful rational transductions %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 241-254 %A Yair Itzhaik %A Amiram Yehudai %T New families of non real time DPDA's and their decidability results %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 255-274 %A Tsutomu Kamimura %A Adrian Tang %T Total objects of domains %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 275-288 %A M. Gogolla %A K. Drosten %A U. Lipeck %A H.-D. Ehrich %T Algebraic and operational semantics of specifications allowing exceptions and errors %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 289-313 %A Minoru Ito %A Motoaki Iwasaki %A Kenichi Taniguchi %A Tadao Kasami %T Membership problems for data dependencies in relational expressions %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 315-335 %A Uwe Schoning %T On small generators %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 337-341 %A Francois Banchilhon %A Philippe Richard %T A sound and complete axiomatization of embedded cross dependencies %J Theoretical Computer Science %K tcs %V 34 %D 1984 %P 343-350 %A K.-J. Lange %A E. Welzl %T Recurrent words and simultaneous growth in T0L systems %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 1-15 %A Jacques Stern %T Characterization of some classes of regular events %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 17-42 %A Stephen L. Bloom %A Douglas R. Troeger %T A logical characterization of observation equivalence %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 43-53 %A Herbert Edelsbrunner %T Finding traversals for sets of simple geometric forms %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 55-69 %A Yves Metivier %T Calcul de longueurs de chaines de reecriture dans le monoide libre %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 71-87 %A Christophe Benoit %T Axiomatisation des tests %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 89-107 %A D. Kapur %A M.S. Krishnamoorthy %A R. McNaughton %A P. Narendran %T An O(|T|^3) algorithm for testing the Church-Rosser property of Thue systems %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 109-114 %A Jean-Pierre Pecuchet %T Automates boustrophedon et mots infinis %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 115-122 %A Laurent Fribourg %T A superposition oriented theorem prover %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 129-164 %A Giorgio Ausiello %A Alessandro d'Atri %A Marina Moscarini %T On the existence of acyclic views in a database scheme %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 165-177 %A Robert Cori %A Yves Metivier %T Recognizable subsets of some partially Abelian monoids %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 179-189 %A G. Memmi %A A. Finkel %T An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 191-214 %K Petri nets %A Kojiro Kobayashi %T On proving time constructibility of functions %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 215-225 %A Paliath Narendran %A Friedrich Otto %T Complexity results on the conjugacy problem for monoids %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 227-243 %A David A. Plaisted %T Complete divisibility problems for slowly utilized oracles %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 245-260 %A Sadaki Hirose %A Satoshi Okawa %A Masaaki Yoneda %T A homomorphic characterization of recursively enumerable languages %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 261-269 %A J.-E. Pin %A J. Sakarovitch %T Une application de la representation matricielle des transductions %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 271-293 %A Tom Head %A John Wilkinson %T Code properties and homomorphisms of D0L systems %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 295-312 %A Ernst Leiss %T On classes of tractable unrestricted regular expressions %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 313-327 %A Michio Oyamaguchi %T On the data type extension problem for algebraic specifications %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 329-336 %A Deepak Kapur %A Paliath Narendran %T A finite Thue system with decidable word problem and without equivalent finite canonical system %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 337-344 %A I. Sain %T A simple proof for the completeness of Floyd's method %J Theoretical Computer Science %K tcs %V 35 %D 1985 %P 345-348 %A Manfred Broy %T On the Herbrand-Kleene universe for nondeterministic computations %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 1-19 %A Joost Engelfriet %T Determinacy -> (observation equivalence = trace equivalence) %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 21-25 %A Ryszard Janicki %T Transforming sequential systems into concurrent systems %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 27-58 %A Norbert Blum %T An Omega(n^4/3) lower bound on the monotone network complexity of the nth degree convolution %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 59-69 %A M.L. Tiomkin %A J.A. Makowsky %T Propositional dynamic logic with local assignments %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 71-87 %A Yochihide Igarashi %T A pumping lemma for real-time deterministic context-free languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 89-97 %A Clelia de\ Felice %T Construction de codes factorisants %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 99-108 %A Sadaki Hirose %A Masaaki Yoneda %T On the Chomsky and Stanley's homomorphic characterization of context-free languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 109-112 %A Keijo Ruohonen %T On equality of multiplicity sets of regular languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 113-117 %A Bruno Scarpellin %T Complex boolean networks obtained by diagonalization %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 119-125 %A Glynn Winskell %T On powerdomains and modality %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 127-137 %A N.E. Fenton %A R.W. Whitty %A A.A. Kaposi %T A generalised mathematical theory of structured programming %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 145-171 %A I.H. Sudborough %A E. Welzl %T Complexity and decidability for chain code picture languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 173-202 %A J. Demel %A M. Demlova %A V. Koubek %T Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 203-216 %A Michael Kaminski %T A classification of omega-regular languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 217-229 %A Eric Allender %A Maria M. Klawe %T Improved lower bounds for the cycle detection problem %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 231-237 %A Ronald Fagin %A Maria M. Klawe %A Nicholas J. Pippenger %A Larry Stockmeyer %T Bounded-depth, polynomial-size circuits for symmetric functions %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 239-250 %A Luis Farinas\ del\ Cerro %A Eaw Orlowska %T DAL - a logic for data analysis %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 251-264 %A Mark R. Jerrum %T The complexity of finding minimum-length generator sequences %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 265-289 %A Hiroshi Matsuno %A Katsushi Inoue %A Hiroshi Taniguchi %A Itsuo Takanami %T Alternating simple multihead finite automata %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 291-308 %A Walter Keller-Gehrig %T Fast algorithms for the characteristic polynomial %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 309-317 %A Krzysztof Diks %T Embeddings of binary trees in lines %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 319-331 %A Helmut Alt %T Multiplication is the easiest nontrivial arithmetic function %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 333-339 %A W. Rytter %A M. Chrobak %T A characterization of reversal-bounded multipushdown machine languages %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 341-344 %A Graham Farr %A Colin McDiarmid %T The complexity of counting homeomorphs %J Theoretical Computer Science %K tcs %V 36 %D 1985 %P 345-348 %A Ker-I Ko %T On some natural complete operators %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 1-30 %A G. Rozenberg %T On coordinated selective substitutions: towards a unified theory of grammars and machines %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 31-50 %A Daved E. Muller %A Paul E. Schupp %T The theory of ends, pushdown automata, and second-order logic %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 51-75 %A J.A. Bergstra %A J.W. Klop %T Algebra of communicating processes with abstraction %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 77-121 %A Jean H. Gallier %A Ronald V. Book %T Reductions in tree replacement systems %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 123-150 %A Luc Bouge %T A contribution to the theory of program testing %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 151-181 %A Karel Culik,\ II %A Ivan Fris %T Topological transformations as a tool in the design of systolic networks %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 183-216 %A Jakob Gonczarowski %A Manfred K. Warmuth %T Applications of scheduling theory to formal language theory %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 217-243 %A Robert De\ Simone %T Higher-level synchronising devices in MEIJE-SCCS %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 245-267 %K algebra of parallel processes, SCCS calculus %A Andrzej Tarlecki %T On the existence of free models in abstract algebraic institutions %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 269-304 %K specification of abstract data types %A Philippe Darondeau %T About fair asynchrony %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 305-336 %K CCS, fairness, parallel communicating agents %A A. Ehrenfeucht %A H.C.M. Kleijn %A G. Rozenberg %T Adding global forbidding context to context-free grammars %J Theoretical Computer Science %K tcs %V 37 %D 1985 %P 337-360 %K formal language theory %A M.P. Fle %A G. Roucairol %T Maximal serializability of iterated transactions %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 1-16 %A Klaus Weihrauch %T Type 2 recursion theory %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 17-33 %A Christoph Kreitz %A Klaus Weihrauch %T Theory of representations %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 35-53 %A Ingo Wegener %T On the complexity of slice functions %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 55-68 %A Marc Snir %T Lower bounds on probabilistic linear decision trees %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 69-82 %A Prakash V. Ramanan %A C.L. Liu %T Permutation representation of k-ary trees %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 83-98 %A Catriel Beeri %A Moshe Y. Vardi %T Formal systems for join dependencies %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 99-116 %A Michael Leconte %T A characterization of power-free morphisms %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 117-122 %A Do Long Van %T Ensenbles code-compatibles et une generalisation du theoreme de Sardinas-Patterson %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 123-132 %A Ernst Leiss %T Succinct representation of regular languages by boolean automata II %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 133-136 %A A. Finkel %T Une generalisation des theoremes de Higman et De Simon aux mots infinis %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 137-142 %A Diana Schmidt %T The recursion-theoretic structure of complexity classes %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 143-156 %A Osamu Watanabe %T On one-one polynomial time equivalence relations %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 157-165 %A Masatosi Imori %A Hisao Yamada %T Periodic character sequences where identifying two characters strictly reduces the period %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 167-192 %A H.D. Burkhard %T AN investigation of controls for concurrent systems based on abstract control languages %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 193-222 %A Matthias Jantzen %T Extending regular expressions with iterated shuffle %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 223-247 %A Takao Asano %T An approach to the subgraph homeomorphism problem %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 249-267 %A B. Mishra %A E. Clarke %T Hierarchical verification of asynchronous circuits using temporal logic %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 269-291 %A Teofilo F. Gonzalez %T Clustering to minimize the maximum intercluster distance %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 293-306 %A D. Harel %A D. Peleg %T Process logic with regular formulas %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 307-322 %A D.J. Rosenkrantz %A H.B. Hunt,\ III %T Testing for grammatical coverings %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 323-341 %A Nathan Linial %A Michael Tarsi %T Deciding hypergraph 2-colourability by H-resolution %J Theoretical Computer Science %K tcs %V 38 %D 1985 %P 343-347 %A Chritiane Frougny %T Context-free grammars with cancellation properties %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 3-13 %A J.-L. Lassez %A M.J. Maher %T Optimal fixedpoints of logic programs %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 15-25 %A Colin Sterling %T A proof-theoretic characterization of observational equivalence %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 27-45 %A R.J.R. Back %A H. Mannila %T On the suitability of trace semantics for modular proofs of communicating processes %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 47-68 %A R. Kannan %T Solving systems of linear equations over polynomials %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 69-88 %A Oscar H. Ibarra %A Michael A. Palis %A Jik H. Chang %T On efficient recognition of transductions and relations %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 89-106 %A Lutz Prieses %T On a fast decomposition method in some models of concurrent computations %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 107-121 %A D. Kapur %A P. Narendran %A M.S. Krishnamoorthy %A R. McNaughton %T The Church-Rosser property and special Thue systems %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 123-133 %A Corrado Bohm %A Alessandro Berarducci %T Automatic synthesis of typed LAMBDA-programs on term algebras %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 135-154 %A Michel Parigot %A Elisabeth Pelz %T A logical approach of Petri net languages %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 155-169 %A Jean-Claude Spehner %T Systemes entiers d'equations sur un alphabet fini et conjecture d'Ehrenfeucht %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 171-188 %A Mario Rodriguez Artalejo %T Some questions about expressiveness and relative completeness in Hoare' logic %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 189-206 %A Stephen R. Mahaney %A Paul Young %T Reductions among polynomial isomorphism types %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 207-224 %A Deborah Joseph %A Paul Young %T Some remarks on witness functions for nonpolynomial and noncomplete sets in NP %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 225-237 %A Richard Hull %T Non-finite specifiability of projections of functional dependency families %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 239-265 %A Jorg Vogel %A Klaus Wagner %T Two-way automata with more than one storage medium %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 267-280 %A Rani Siromoney %A V. Rajkumar Dare %T On infinite words obtained by selective substitution grammars %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 281-295 %A Armin Haken %T The intractability of resolution %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 297-308 %A Seymour Ginsburg %A Edwin H. Spanier %T On completing tables to satisfy functional dependencies %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 309-317 %A Ronald V. Book %A Freidrich Otto %T On the security of name-stamp protocols %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 319-325 %A Ernst L. Leiss %T On solving star equations %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 327-332 %A Andre Arnold %T A syntactic congruence for rational omega-languages %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 333-335 %A M.W. Bunder %T An extension of Klop's counterexample to the Church-Rosser property to lambda-calculus with other ordered pair combinators %J Theoretical Computer Science %K tcs %V 39 %D 1985 %P 337-342 %A Juhani Karhumaki %T On three-element codes %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 3-11 %A Antonio Restivo %A Chritophe Reutenauer %T Rational languages and the Burnside problem %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 13-30 %A A. Blumer %A J. Blumer %A D. Haussler %A A. Ehrenfeucht %A M.T. Chen %A J. Seiferas %T The smallest automation recognizing the subwords of a text %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 31-55 %A Uwe Schoning %T Robust algorithms: a different approach to oracles %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 57-66 %A Robert Paige %A Robert E. Tarjan %A Robert Bonic %T A linear time solution to the single function coarsest partition problem %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 67-84 %A G. Bauer %T n-level rewriting systems %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 85-99 %A Ronald V. Book %A Friedrich Otto %T On the verifiability of two-party algebraic protocols %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 101-130 %A W. Bucher %A A. Ehrenfeucht %A D. Haussler %T On total regulators generated by derivation relations %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 131-148 %A I.J. Aalbersberg %A G. Rozenberg %T CTS systems and Petri nets %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 149-162 %A Kathleen Ayers %T Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 163-174 %A Kojiro Kobayashi %T On the structure of one-tape nondeterministic Turing machine time hierarchy %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 175-193 %A Ming-Deh A. Huang %A Karl J. Lieberherr %T Implications of forbidden structures for extremal algorithmic problems %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 195-210 %A Gianfranco Mascari %A Marisa Venturini Zilli %T While-programs with nondeterministic assignments and the logic ALNA %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 211-235 %A Jose L. Balcazar %A Ronald V. Book %A Uwe Schoning %T On bounded query machines %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 237-243 %A Taiho Kanaoka %A Singo Tomita %T Homogeneous decomposition of stochastic systems %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 245-255 %A S. Kamal Abdali %A B. David Saunders %T Transitive closure and related semiring properties via eliminants %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 257-274 %A F. Fogelman-Soulie %T Parallel and sequential computation on boolean networks %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 275-300 %A A. Ginzburg %A M. Yoeli %T Reducibility of synchronization structures %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 301-314 %A Freidrich J. Urbanek %T On Greibach normal form construction %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 315-317 %A Michael Kaminski %T A lower bound for polynomial multiplication %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 319-322 %A M.S. Krishnamoorthy %A P. Narendran %T On recursive path ordering %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 323-328 %A Georges Gonthier %T Algebraic calculi of processes and net expressions %J Theoretical Computer Science %K tcs %V 40 %D 1985 %P 329-337 %A Gheorghe Paun %T A variant of random context grammars: semi-conditional grammars %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 1-17 %A Ch.E. Coles %T Dynamics of positive automata networks %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 19-32 %A Virgil Emil Cazanescu %T On context-free trees %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 33-50 %A Philippe Gohon %T An algorithm to decide whether a rational subset of N^k is recognizable %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 51-59 %A Evelyne Barbin-Le Rest %A Michel Le Rest %T Sur la combinatoire des codes a deux mots %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 61-80 %A Costas S. Iliopoulos %T Computing in general Abelian groups is hard %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 81-93 %A Susumu Hayashi %T Adjunction of semifunctors: categorical structures in nonextensional lambda calculus %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 95-104 %A Tael Maon %T On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 105-107 %A Jean-Yves Thibon %T Integrite des algebres de series formelles sur un alphabet partiellement commutatif %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 109-112 %A M.W. Bunder %T Possible forms of evaluation or reduction in Martin-Lof type theory %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 113-120 %A M.H. Albert %A J. Lawrence %T A proof of Ehrenfeucht's conjecture %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 121-123 %A Bettina Helfrich %T Algorithms to contruct Minkowski reduced and Hermite reduced lattice bases %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 125-139 %A Burkhard Monien %A Ivan Hal Sudborough %T Bandwidth constrained NP-complete problems %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 141-167 %A E. Dahlhaus %A H. Gaifman %T Concerning two-adjacent context-free languages %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 169-184 %A Wolfgang Reisig %T Petri nets with individual tokens %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 185-213 %A Juhani Karhumaki %T A property of three-element codes %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 215-222 %A Etsuji Tomita %A Kazushi Seino %T A weaker suficient condition for the equivalence of a pair of DPDA's to be decidable %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 223-230 %A Oscar H. Ibarra %A Michael A. Palis %A Sam M. Kim %T Fast parallel language recognition by cellular automata %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 231-246 %A Elisabeth Pelz %T On the complexity of theories of permutations %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 247-269 %A John Grant %A Jack Minker %T Inferences for numerical dependencies %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 271-287 %A Sachio Hirokawa %T Complexity of the combinator reduction machine %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 289-303 %A Giora Slutzki %T Alternating tree automata %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 305-318 %A H.-J. Stoss %T The complexity of evaluating interpolation polynomials %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 319-323 %A Friedhelm Meyer\ auf\ der Heide %T Simulating probabilistic by deterministic algebraic computation trees %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 325-330 %A Katsushi Inoue %A Itsuo Takanami %A Roland Vollmar %T Alternating on-line Turing machines with only universal states and small space bounds %J Theoretical Computer Science %K tcs %V 41 %D 1985 %P 331-339 %A Bruno Courcelle %T Equivalence and transformations of regular systems - applications to recursive program schemes and grammars %J Theoretical Computer Science %K tcs %V 42 %D 1986 %P 1-122 %A M. Wirsing %T Structured algebraic specifications: a kernel language %J Theoretical Computer Science %K tcs %V 42 %D 1986 %P 123-250 %A Joost Engelfriet %A Heiko Vogler %T Pushdown machines for the macro tree transducer %J Theoretical Computer Science %K tcs %V 42 %D 1986 %P 251-368 %A Jerzy W. Gryzmala-Busse %A Zamir Bavel %T Characterization of state-independent automata %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 1-10 %A Arnold Scheuing %T Decomposition of linear automata over residue rings into shift-registers %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 11-30 %A Christian Ronse %T A topological characterization of thinning %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 31-41 %A Leslie M. Goldschlager %A Ian Parberry %T On the construction of parallel computers from various bases of boolean functions %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 43-58 %A Roman E. Redziejowski %T Infinite-word languages and continuous mappings %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 59-79 %A Ewa Orlowska %T Semantic analysis of inductive reasoning %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 81-89 %A G. Hansel %T Une demonstration simple du theoreme de Skolem-Mahler-Lech %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 91-98 %A P. Clote %T On the finite containment problem for Petri nets %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 99-105 %A Peter A. Lindsay %T Alternation and omega-type Turing acceptors %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 107-115 %A M.H. Albert %A J. Lawrence %T Test sets for finite substitutions %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 117-122 %A R. Berghammer %A H. Zierer %T Relational algebraic semantics of deterministic and nondeterministic programs %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 123-147 %A Jan Heering %T Partial evaluation and omega-completeness of algebraic specifications %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 149-167 %A Mark R. Jerrum %A Leslie G. Valiant %A Vijay V. Vazirani %T Random generation of combinatorial structures from a uniform distribution %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 169-188 %A Francois Fages %A Gerard Huet %T Complete sets of unifiers and mathers in equational theories %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 189-200 %A Ingo Wegener %T More on the complexity of slice functions %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 201-211 %A Ryszard Janicki %A Peter E. Lauer %A Maciej Koutny %A Raymond Devillers %T Concurrent and maximally concurrent evolution of nonsequential systems %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 213-238 %A Gad M. Landau %A Uzi Vishkin %T Efficient string matching with k mismatches %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 239-249 %A Ana Pasztor %A Rick Statman %T Scott induction and closure under omega-sups %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 251-263 %A Aldo de\ Luca %A Antonio Restivo %T Star-free sets of integers %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 265-275 %A I. Suzuki %A Y. Motohashi %A K. Taniguchi %A T. Kasami %A T. Okamoto %T Specification and verification of decentralized daisy chain arbiters with omega-extended regular expressions %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 277-291 %A J. Adamek %A J. Reiterman %A E. Nelson %T Continuous semilattices %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 293-313 %A A. Saoudi %T Varietes d'automates descendants d'arbres infinis %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 315-335 %A Keith Edwards %T The complexity of colouring problems on dense graphs %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 337-343 %A Donald B. Johnson %T A simple proof of a time-space trade-off for sorting with linear comparisons %J Theoretical Computer Science %K tcs %V 43 %D 1986 %P 345-350 %A P. Ritzmann %T A fast numerical algorithm for the composition of power series with complex coefficients %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 1-16 %A F. Blanchard %A G. Hansel %T Systemes codes %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 17-49 %A D. Leivant %T Typing and computational properties of lambda expressions %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 51-68 %A L.E. Rosier %A H.-C. Yen %T Boundedness, empty channel detection, and synchronization for communicating finite automata %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 69-105 %A F. Blanchard %A S. Martinez %T Points d'orbite dense de certains langages de mots infinis %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 107-110 %A J.H. Chang %A O.H. Ibarra %A M.A. Palis %A B. Ravikumar %T On pebble automata %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 111-121 %A E. Paul %T On solving the equality problem in theories defined by Horn clauses %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 127-153 %A Ernst L. Leiss %T Generalized language equations with multiple solutions %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 155-174 %A Yuji Kobayashi %T Repetition-free words %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 175-197 %A Volker Diekert %T Complete semi-Thue systems for Abelian groups %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 199-208 %A T. Etzion %T An algorithm for generating shift-register cycles %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 209-224 %A Satoshi Okawa %A Sadaki Hirose %A Masaaki Yoneda %T On the impossibility of the homomorphic characterization of context-sensitive languages %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 225-228 %A Friedrich J. Urbanek %T On Greibach normal form construction %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 229-236 %A Paliath Narendran %T On the equivalence problem for regular Thue systems %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 237-245 %A Paul E. Dunne %T The complexity of central slice functions %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 247-257 %A Masako Takahashi %T The greatest fixed-points and rational omega-tree languages %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 259-274 %A Hans-Jorg Kreowski %A Anne Wilharm %T Net processes correspond to derivation processes in graph grammars %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 275-305 %K Petri nets %A William F. Dowling %A Jean H. Gallier %T Continuation semantics for flowgraph equations %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 307-331 %A Ebbe Thue Poulsen %T The Ehrenfreucht conjecture: an algebra-framework for its proof %J Theoretical Computer Science %K tcs %V 44 %D 1986 %P 333-339