%A A. van\ Wijngaarden %T The generative power of two-level grammars %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 9-16 %A J. van\ Leeuwen %T A generalisation of Parikh's theorem in formal language theory %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 17-26 %A E. Shamir %A C. Beeri %T Checking stacks and context-free programmed grammars accept P-complete languages %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 27-33 %A W.P. de\ Roever %T Recursion and parameter mechanisms: an axiomatic approach %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 34-65 %A A. Martelli %A U. Montanari %T Dynamic programming schemata %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 66-80 %A C. de\ Michelis %A C. Simone %T Semantic characterization of flow diagrams and their decomposability %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 81-96 %A P. Kandzia %T On the most recent property of Algol-like programs %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 97-111 %A J. Arsac %T Langages sans etiquettes et transformations de programmes %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 112-128 %A G. Ausiello %T Relations between semantics and complexity of recursive programs %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 129-140 %A J.C. Reynolds %T On the relation between direct and continuation semantics %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 141-156 %A G. Pacini %A C. Montangero %A F. Turini %T Graph representation and computation rules for typeless recursive languages %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 157-169 %A M. Dezani-Ciancaglini %A M. Zacchi %T Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 170-184 %A C. Bohm %A M. Dezani-Ciancaglini %T Combinatorial problems, combinator equations and normal forms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 185-199 %A B. Courcelle %A G. Kahn %A J. Vuillemin %T Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 200-213 %A D.B. Lomet %T Automatic generation of multiple exit parsing subroutines %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 214-231 %A M.M. Geller %A S.L. Graham %A M.A. Harrison %T Production prefix parsing %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 232-241 %A D. Pager %T On eliminating unit productions from LR(k) parsers %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 242-254 %A B. Lang %T Deterministic techniques for efficient non-deterministic parsers %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 255-269 %A W. Lipski %A W. Marek %T File organization, an application of graph theory %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 270-279 %A B. Monien %T Characterizations of time-bounded computations by limited primitive recursion %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 280-293 %A C.P. Schnorr %T On maximal merging of information in boolean computations %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 294-300 %A J. Hartmanis %A T.P. Baker %T On simple Goedel numberings and translations %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 301-316 %A K. Mehlhorn %T The "almost all" theory of subrecursive degrees is decidable %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 317-325 %A K. Weihrauch %T The computational complexity of program schemata %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 326-334 %A M. Fontet %T Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorhismes d'un automate fini %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 335-341 %A Y. Cesari %T Sur l'application du theoreme de Suschkewitsch a l'etude des codes rationnels complete %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 342-350 %A F. Gecseg %T Composition of automata %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 351-363 %A A.B. Cremers %A S. Ginsburg %T Context-free grammar forms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 364-382 %A J. Berstel %A L. Boasson %T Une suite descroissante de cones rationnels %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 383-397 %A G. Hotz %T Komplexitatsmase fur ausdrucke %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 398-412 %A P.C. Fischer %A R.L. Probert %T Efficient procedures for using matrix algorithms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 413-427 %A P.C. Fischer %T Further schemes for combining matrix algorithms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 428-436 %A R.V. Book %T On the structure of complexity classes %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 437-445 %A P. Flajolet %A J.M. Steyaert %T On sets having only hard subsets %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 446-457 %A R. Weicker %T Turing machines with associative memory access %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 458-472 %A A. Ehrenfeucht %A G. Rozenberg %T Trade-off between the use of noonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 473-480 %A M. Novotny %T Operators reducing generalized OL-systems %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 481-494 %A K. Culik,\ II %T Parallel rewriting systems on terms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 495-510 %A M. Blattner %T Transductions of context-free languages into sets of sentential forms %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 511-522 %A A. Salomaa %T Parallelism in rewriting systems %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 523-533 %A R. Kemp %T Mehrdeutigkeiren kontextfreier Grammatiken %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 534-546 %A W. Dilger %A P. Raulefs %T Monadic program schemes under restricted classes of free interpretations %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 547-561 %A A.K. Chandra %T Generalized program schemas %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 562-576 %A E. Bertsch %T A decidability result for sequntial grammars %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 577-583 %A A. Kreczmar %T Effectivity problems of algorithmic logic %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 584-600 %A P.J. Hayes %T Simple and structural redundancy in non-deterministic computation %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 601-611 %A M.P. Schutzenberger %T Sur une propriete syntactique des relations rationnelles %J Proceedings of the Second Colloqium on Automata, Languages and Programming %E Jacques Loeckx %C Saarbrucken, Germany %D July 1974 %O published as Lecture Notes in Computer Science 14 by Springer-Verlag %K icalp icalp2 icalp74 %P 612-619 %A M. Linna %T On Omega-sets associated with context-free languages %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 1-19 %A E. Soisalon-Soininen %A E. Ukkonen %T A characterization of LL(k) languages %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 20-30 %A L.G. Valiant %T The equivalence problem for DOL systems and its decidability for binary alphabets %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 31-37 %A A. Restivo %T On a family of codes %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 38-44 %A D. Perrin %T Sur la longueur moyenne des codes prefixes %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 45-51 %A J. Sakarovitch %T Sur les monoides syntactiques des langages algebriques deterministes %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 52-65 %A J. Beauquier %T Generateurs algebriques non-ambigus %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 66-73 %A A. Arnold %A M. Dauchet %T Bi-transductions de forets %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 74-86 %A F. Kroger %T Logical rules of natural reasoning about programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 87-98 %A M.H. Van\ Emden %T Verification conditions as programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 99-119 %A W. Lipski,\ Jr. %T Informational systems with incomplete information %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 120-130 %A J. Schwartz %T Event based reasoning - a system for proving correct termination of programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 131-146 %A G. Longo %A M. Venturini Zilli %T A theory of computation with an identity discriminator %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 147-167 %A G. Berry %A B. Courcelle %T Program equivalence and canonical forms in stable discrete interpretations %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 168-188 %A I. Guessarian %T Semantic equivalence of program schemes and its syntactic characterization %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 189-200 %A D. Brand %T Proving programs incorrect %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 201-227 %A R. Cartwright %T User-defined data types as an aid to verifying Lisp programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 228-256 %A D.P. Friedman %A D.S. Wise %T Cons should not evaluate its arguments %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 257-284 %K lazy evaluation %A J. Gill %A I. Simon %T Ink, dirty-tape Turing machines, and quasicomplexity measures %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 285-306 %A W.F. McColl %T The depth of Boolean functions %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 307-321 %A C.P. Schnorr %T Optimal algorithms for self-reducible problems %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 322-337 %A H. Alt %A K. Mehlhorn %T Lower bounds for the space complexity of context-free recognition %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 338-354 %A Z. Galil %T On enumeration procedures for theorem proving and for integer programming %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 355-381 %A J. van\ Leeuwen %T On the construction of Huffman trees %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 382-410 %A M. Fontet %T A linear algorithm for testing isomorphism of planar graphs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 411-424 %A P.A. Bloniarz %A M.J. Fischer %A A.R. Meyer %T A note on the average time to compute transitive closure %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 425-434 %A J.W. de\ Bakker %T Semantics and termination of nondeterministic recursive programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 435-477 %A M. Hennessy %A E.A. Ashcroft %T The semantics of nondeterminism %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 478-493 %A I. Greif %T On proofs of programs for synchronization %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 494-507 %A H-D. Ehrich %T Outline of an algebraic theory of structured objects %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 508-530 %A M. Sintzoff %T Eliminating blind alleys from backtrack programs %J Proceedings of the Third International Colloqium on Automata, Languages and Programming %E S. Michaelson %E R. Milner %C Edinburgh, Scotland %D July 1976 %O published by Edinburgh University Press %K icalp icalp3 icalp76 %P 531-557 %A A.V. Aho %A R. Sethi %T How hard is compiler code generation ? %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 1-15 %A D.A. Alton %T "Natural" complexity measures and time versus memory: some definitional proposals %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 16-29 %A K.R. Apt %A J.W. de\ Bakker %T Semantics and proof theory of Pascal procedures %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 30-44 %A G. Ausiello %A A. D'Atri %A M. Protasi %T On the structure of combinatorial problems and structure preserving reductions %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 45-60 %A R.C. Backhouse %A R.K. Lutz %T Factor graphs, failure functions and bi-trees %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 61-75 %A D.B. Benson %A R.D. Jeffords %T Parallel decomposition of LR(k) parsers %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 76-86 %A A. Bertoni %A G. Mauri %A M. Torelli %T Some recursively enumerable problems relating to isolated cutpoints in probabilistic automata %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 87-94 %A C. Bohm %A M. Coppo %A M. Dezani-Ciancaglini %T Termination tests inside lambda-calculus %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 95-110 %A R.V. Book %A C.K. Yap %T On the computational power of reversal-bounded machines %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 111-119 %A F.-J. Brandenburg %T The context-sensitity bounds of context-sensitive grammars and languages %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 120-134 %A M.P. Chytil %A V. Jakl %T Serial composition of 2-way finite-state transducers and simple programs on strings %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 135-147 %A K. Culik,\ II %A I. Fris %T The sequence equivalence problem for DOL systems is decidable %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 148-163 %A W. Damm %T Languages defined by higher type program schemes %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 164-179 %A E.-W. Dietrich %T Parsing and syntactic error recovery for context-free grammars by means of coarse structures %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 180-192 %A A.Ja. Dikovskii %A L.S. Modina %T On three types of ambiguity of context-free languages %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 193-204 %A H. Ehrig %A B.K. Rosen %T The mathematics of record handling %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 206-220 %A J. Engelfriet %T Macro grammars, Lindenmayer systems and other copying devices %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 221-229 %A W.J. Erni %T On the time and tape complexity of hyper(1)-AFL's %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 230-243 %A M. Hopner %A M. Opp %T Renaming and erasing in Szilard languages %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 244-257 %A A. Itai %A M. Rodeh %T Some matching problems %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 258-268 %A G. Jacob %T Complexite des demi-groupes de matrices %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 269-281 %A T.M.V. Janssen %A P. van\ Emde\ Boas %T On the proper treatment or referencing. dereferencing and assignment %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 282-300 %A N.D. Jones %A S. Skyum %T Complexity of some problems concerning L systems %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 301-308 %A H.P. Kriegel %A Th. Ottman %T Left-fitting translations %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 309-322 %A K. Mehlhorn %T Dynamic binary search %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 323-336 %A B. Monien %T About the derivation languages of grammars and machines %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 337-351 %A A. Nijholt %T Simple chain grammars %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 352-364 %A W.J. Paul %A R.E. Tarjan %T Time-space tradeoffs in a pebble game %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 365-369 %A A. Paz %A S. Moran %T Non-deterministic polynomial optimization problems and their approximation %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 370-379 %A A. Pnueli %A G. Slutzki %T Simple programs and their decision problem %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 380-390 %A V. Rajlich %T Theory of data structures by relational and graph grammars %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 391-411 %A W.P. de\ Roever %T On backtracking and greatest fixpoints %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 412-429 %A G. Rozenberg %A D. Vermeir %T L systems of finite index %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 430-439 %A J. Sajaniemi %T The safety of a coroutine system %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 440-452 %A W.J. Savitch %A P.M.B. Vitanyi %T Linear time simulation of multihead Turing machines with head-to-head jumps %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 453-464 %A A. Shamir %A W.W. Wadge %T Data types as objects %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 465-479 %A J. Simon %T On the difference between one and many %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 480-491 %A S. Sippu %A E. Soisalon-Soininen %T On defining error recovery in context-free parsing %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 492-503 %A I. Streinu %T LL(k) languages are closed under union with finite languages %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 504-508 %A I.H. Sudborough %T The time and tape complexity of developmental languages %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 509-523 %A M. Takahashi %T Rational relations of binary trees %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 524-538 %A H.K.-G. Walter %T Structural equivalence of context-free grammar forms is decidable %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 539-553 %A B. Courcelle %T On the definition of classes of interpretations %J Proceedings of the Fourth International Colloqium on Automata, Languages and Programming %E Arto Salomaa %E Magnus Steinby %C Turku, Finland %D July 1977 %O published as Lecture Notes in Computer Science 52 by Springer-Verlag %K icalp icalp4 icalp77 %P 554-569 %A Jurgen Albert %A Hermann Maurer %A Grzegorz Rozenberg %T Simple EOL forms under uniform interpretation generating CF languages %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 1-14 %A Doris Altenkamp %A Kurt Mehlhorn %T Codes: unequal probabilities, unequal letter costs %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 15-25 %A A. Arnold %A M. Dauchet %T Sur l'inversion des morphismes d'arbres %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 26-35 %A Gerhard Barth %T Grammars with dynamic control sets %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 36-51 %A Joffroy Beauquier %T Ambiguite forte %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 52-62 %A Piotr Berman %T Relationship between density and deterministic complexity of NP-complete languages %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 63-71 %A Gerard Berry %T Stable models of typed lambda-calculi %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 72-89 %A Joachim Biskup %T Path measures of Turing machine computations (preliminary report) %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 90-104 %A J.M. Boe %T Une famille remarque de codes indecomposables %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 105-112 %A Ronald V. Book %A Sheila A. Greibach %A Celia Warthall %T Comparisons and reset machines (preliminary report) %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 113-124 %A Beate Commentz-Walter %T Size-depth tradeoff in boolean formulas (extended abstract) %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 125-141 %A M. Coppo %A M. Dezani-Ciancaglini %A S. Ronchi della\ Rocca %T (Semi)- separability of finite sets of terms in Scott's Dinf-models of the lambda-calculus %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 142-164 %A Armin B. Cremers %A Thomas N. Hibbard %T Mutual exclusion of N processors using an O(N)-valued message variable %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 165-176 %A W. Damm %A E. Fehr %T On the power of self-application and higher type recursion %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 177-191 %A David Dobkin %A J. Ian Munro %T Time and space bounds for selection problems %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 192-204 %A Hartmut Ehrig %A Hans-Jorg Kreowski %A Peter Padawitz %T Stepwise specification and implementation of abstract data types %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 205-226 %A Steven Fortune %A John Hopcroft %A Erik Melneche Schmidt %T The complexity of equivalence and containment for free single variable program schemes %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 227-240 %A Zvi Galil %T On improving the worst case running time of the Boyer-Moore string matching algorithm %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 241-250 %A Jean H. Gallier %T Semantics and correctness of nondeterministic flowchart programs with recursive procedures (preliminary report) %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 251-267 %A David Harel %T Arithmetical completeness in logics of programs %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 268-288 %A Alon Itai %A Michael Rodeh %T Covering a graph by circuits %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 289-299 %A Andrzej Lingas %T A PSPACE complete problem related to a pebble game %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 300-321 %A Maurice Mignotte %T Some effective results about linear recursive sequences %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 322-329 %A Anton Nijholt %T On the parsing and covering of simple chain grammars %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 330-344 %A J.E. Pin %T Sur un cas particulier de la conjecture de Cerny %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 345-352 %A John K. Price %A Detlef Wotschke %T States can sometimes do more than stack symbols in PDA's %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 353-362 %A Antonio Restivo %T Some decision problems for reconfigurable sets in arbitrary monoids %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 363-371 %A Christophe Reutenauer %T Sure les series rationelles en variables non commutatives %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 372-381 %A Mikko Saarinen %T On constructing efficient evaluators for attribute grammars %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 382-397 %A Patrick Salle %T Une extension de la theorie des types an lambda-calcul %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 398-410 %A Walter J. Savitch %T Parallel and nondeterministic time complexity classes (preliminary report) %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 411-424 %A C.P. Schnorr %T Multiterminal network flow and connectivity in unsymmetrical networks %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 425-439 %A E. Sciore %A A. Tang %T Admissible coherent c.p.o.'s %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 440-456 %A Tommaso Toffoli %T Integration of the phase-difference relations in asynchronous sequential networks %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 457-463 %A Rudiger Valk %T Self-modifying nets, a natural extension of Petri nets %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 464-476 %A Marisa Venturini Zilli %T Head requirement terms in combinatory logic: a generalization of the notion of head normal form %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 477-493 %A Rolf Wiehagen %T Characterization problems in the theory of inductive inference %J Proceedings of the Fifth International Colloqium on Automata, Languages and Programming %E G. Ausiello %E C. Bohm %C Udine, Italy %D July 1978 %O published as Lecture Notes in Computer Science 62 by Springer-Verlag %K icalp icalp5 icalp78 %P 494-508 %A E. Astesiano %A G. Costa %T Sharing in nondeterminism %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 1-15 %A J. Berstel %T Sur les mots sans carre definis un morphisme %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 16-24 %A A. Bertoni %A G. Mauri %A P.A. Miglioli %T A characterization of abstract data as model-theoretic invariants %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 25-37 %A M. Blattner %T Inherent ambiguities in families of grammars %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 38-48 %A R.V. Book %A F.-J. Brandenburg %T Representing complexity classes by equality sets %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 49-57 %A B.V. Braunmuhl %A E. Hotzel %T Supercounter machines %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 58-72 %A M. Broy %A W. Dosch %A H. Partsch %A P. Pepper %A M. Wirsing %T Existential quantifiers in abstract data types %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 73-87 %A C. Choffrut %T A generalization of Ginsburg's and Rose's characterization of G-S-M mappings %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 88-103 %A L. Chottin %T Strict deterministic languages and controlled rewriting systems %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 104-117 %A B. Commentz-Walter %T A string matching algorithm fast on the average %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 118-132 %A M. Coppo %A M. Dezani-Ciancaglini %A P. Salle %T Functional characterization of some semantic equalities inside lambda-calculus %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 133-146 %A A.B. Cremers %A T.N. Hibbard %T Arbitration and queueing under limited shared storage requirements %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 147-160 %A K. Culik,\ II %T On the homomorphic characterizations of families of languages %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 161-170 %A P. Dembinski %A J. Maluszynski %T Two level grammars: CF-grammars with equation schemes %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 171-187 %A N. Dershowitz %A Z. Manna %T Proving termination with multiset orderings %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 188-202 %A P. Deussen %T One abstract accepting algorithm for all kinds of parsers %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 203-217 %A A.G. Duncan %A L. Yelowitz %T Studies in abstract/concrete mappings in proving algorithm correctness %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 218-229 %A F.E. Fich %A J.A. Brzozowski %T A characterization of a dot-depth two analogue of generalized definite languages %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 230-244 %A D. Friede %T Partitioned LL(k) grammars %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 245-255 %A J.H. Gallier %T Recursion schemes and generalized interpretations %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 256-270 %A J. Goldstine %T A rational theory of AFLs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 271-281 %A J. Hartmanis %T On the succinctness of different representations of languages %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 282-288 %A S. Istrail %T A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 289-303 %A W. Janko %T Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 304-315 %A H.J. Jeanrond %T A uniqe termination theorem for a theory with generalized commutative axioms %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 316-330 %A T. Kamimura %A G. Slutzki %T Dags and Chomsky hierarchy %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 331-337 %A R. Karp %T Recent advances in the probabilistic analysis of graph-theoretic algorithms (abstract only) %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 338-339 %A R. Kemp %T On the average stack size of regularly distributed binary trees %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 340-355 %A W. Kowalk %A R. Valk %T On reductions of parallel programs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 356-369 %A W. Kuich %A H. Prodinger %A F.J. Urbanek %T On the height of derivation trees %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 370-384 %A Z. Manna %A A. Pnueli %T The model logic of programs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 385-410 %A F. Meyer\ auf\ der\ Heide %T A comparison between two variations of a pebble game on graphs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 411-421 %A D.R. Milton %A C.N. Fischer %T LL(k) parsing for attributed grammars %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 422-430 %A B. Monien %A I.H. Sudborough %T On eliminating nondeterminism from Turing machines which use less than logarithm worktape space %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 431-445 %A A. Nijholt %T Structure preserving transformations on non-left-recursive grammars %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 446-459 %A C.H. Papadimitriou %A M. Yannakakis %T The complexity of restricted minimum spanning tree problems %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 460-470 %A G. Rozenberg %T A systematic approach to formal language theory through parallel rewriting %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 471-478 %A G. Rozenberg %A D. Vermeir %T Extending the notion of finite index %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 479-488 %A W.L. Ruzzo %T On the complexity of general context-free language parsing and recognition %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 489-497 %A J.E. Savage %A S. Swamy %T Space-time tradeoffs for oblivious integer multiplication %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 498-504 %A G. Schmidt %T Investigating programs in terms of partial graphs %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 505-519 %A A. Schonhage %T On the power of random access machines %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 520-529 %A R.L. Schwartz %T An axiomatic treatment of Algol 68 routines %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 530-545 %A A.L. Selman %T P-selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 546-555 %A R. Sethi %A A. Tang %T Constructing call-by-value continuation semantics %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 556-570 %A M.W. Shields %A P.E. Lauer %T A formal semantics for concurrent systems %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 571-584 %K COSY, path expressions, Petri nets %A S. Sippu %A E. Soisalon-Soininen %T On constructing LL(k) parsers %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 585-595 %A J.W. Thatcher %A E.G. Wagner %A J.B. Wright %T More on advice on structuring compilers and proving them correct %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 596-615 %A D. Therien %T Languages of nilpotent and solvable groups %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 616-632 %A J. Tiuryn %T Unique fixed points vs. least fixed points %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 633-645 %A E. Ukkonen %T A modification of the LR(k) method for constructing compact bottom-up parsers %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 646-658 %A L. Ury %T Optimal decomposition of linear automata %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 659-667 %A L. Wegner %T Bracketed two-level grammars - a decidable and practical approach to language definitions %J Proceedings of the Sixth International Colloqium on Automata, Languages and Programming %E Hermann A. Maurer %C Graz, Austria %O published as Lecture Notes in Computer Science 71 by Springer-Verlag %D July 1979 %K icalp icalp6 icalp79 %P 668-682 %A W. Ainhirn %T How to get rid of pseudoterminals %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 1-11 %A J. Albert %A K. Culik,\ II %T Test sets for homomorphism equivalence on context free languages %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 12-18 %A J. Albert %A L. Wegner %T Languages with homomorhic replacements %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 19-29 %A H. Alt %T Functions equivalent to integer multiplication %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 30-37 %A E. Astesiano %A G. Costa %T Languages with reducing reflexive types %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 38-50 %A R.-J. Back %T Semantics of unbounded nondeterminism %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 51-63 %A R.I. Becker %A Y. Perl %A St.R. Schach %T A shifting algorithm for min-max tree partitioning %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 64-75 %A J.A. Bergstra %A J.V. Tucker %T A characterization of computable data types by means of a finite equational specification method %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 76-90 %A P. Berman %T A note on sweeping automata %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 91-97 %A D. Bini %T Border rank of a p*q*2 tensor and the optimal approximation of a pair of bilinear forms %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 98-108 %A L. Boasson %T Derivations et reductions dans les grammaires algebriques %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 109-118 %A P. Cousot %A R. Cousot %T Semantic analysis of communicating sequential processes %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 119-133 %A E. Ehrenfeucht %A G. Rozenberg %T DOS systems and languages %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 134-141 %A H. Ehrig %A H.-J. Kreowski %A P. Padawitz %T Algebraic implementation of abstract data types: concept, syntax semantics and correctness %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 142-156 %A H. Ehrig %A H.-J. Kreowski %A J. Thatcher %A E. Wagner %A J. Wright %T Parameterized data types in algebraic specification languages %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 157-168 %A E.A. Emerson %A E.M. Clarke %T Characterizing correctness properties of parallel programs using fixpoints %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 169-181 %A J. Engelfriet %A G. File %T Formal properties of one-visit and multi-pass attribute grammars %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 182-194 %A S. Even %A Y. Yacobi %T Cryptocomplexity and NP-completeness %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 195-207 %A Ph. Flajolet %A J.-M. Steysert %T On the analysis of tree-matchinmg algorithms %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 208-220 %A G.N. Frederickson %A D.B. Johnson %T Generating and searching sets induced by networks %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 221-233 %A M. Furer %T The complexity of the inequivalence problem for regular expressions with intersection %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 234-245 %A Z. Galil %T An almost linear time algorithm for computing a dependency basis in a relational data base %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 246-256 %A H.J. Genrich %A P.S. Thiagaran %T Bipolar synchronization systems %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 257-272 %A A. Goralcikova %A P. Goralcik %A V. Koubek %T Testing of properties of finite algebras %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 273-281 %A J. Gray %T A transaction model %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 282-298 %A M. Hennessy %A R. Milner %T On observing nondeterminism and concurrency %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 299-309 %A G. Hornung %A P. Raulefs %T Terminal algebra semantics and retractions for abstract data types %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 310-323 %A Th.D-. Huynh %T The complexity of semilinear sets %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 324-337 %A J.R. Kenneway %A C.A.R. Hoare %T A theory of nondeterminism %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 338-350 %A D. Kozen %T A representation theorem for models of *-free PDL %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 351-362 %A H. Langmaack %A E.R. Olderog %T Present-day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 363-373 %A H.R. Lewis %A Ch.H. Papadimitriou %T Symmetric space-bounded computation %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 374-384 %A A. de\ Luca %A A. Restivo %T On some properties of local testability %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 385-393 %A M.E. Majster-Cederbaum %T Semantics: algebras, fixed point, axioms %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 394-408 %A J.A. Makowsky %T Measuring the expressive power of dynamic logics: an application of abstract model theory %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 409-421 %A K. Mehlhorn %T Pebbling mountain ranges and its application to DFCL-recognition %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 422-435 %A E. Meineche Schmidt %T Space-restricted attribute grammars %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 436-448 %A P. Mosses %T A constructive approach to compiler correctness %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 449-469 %A Ch.H. Papadimitriou %A J.L. Bentley %T A worst-case analysis of nearest neighbor searching by projection %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 470-482 %A J.-E. Pin %T Proprietes syntactiques du produit non ambigu %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 483-499 %A K.-J. Raiha %A E. Ukkonen %T On the optimal assignment of attributes to passes in multi-pass attribute evaluators %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 500-511 %A J.C. Raoult %A J. Vuillemin %T Optimal unbounded search strategies %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 512-530 %A R. Reischuk %T A "fast implementation" of a multidimensional storage into a tree storage %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 531-542 %A A. Salomaa %T Grammatical families %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 543-554 %A P. Schlichtiger %T Partitioned chain grammars %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 555-568 %A J. Schmidt %A E. Shamir %T An improved program for constructing open hash tables %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 569-581 %A A. Shamir %T On the power of commutativity in cryptography %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 582-595 %A S. Sippu %A E. Soisalon-Soininen %T Characterizations of the LL(k) property (extended abstract) %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 596-608 %A M.B. Smyth %T Computability in categories %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 609-620 %A M. Snir %T On the size complexity of monotone formulas %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 621-631 %A T. Toffoli %T Reversible computing %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 632-644 %A V.F. Turchin %T The use of metasystem transition in theorem proving and program optimization %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 645-657 %A P.M.B. Vitanyi %T On the power of real-time Turing machines under varying specifications %J Proceedings of the Seventh International Colloqium on Automata, Languages and Programming %E J.W. de Bakker %E J. van\ Leeuwen %C Noordwijkerhout, Netherlands %O published as Lecture Notes in Computer Science 85 by Springer-Verlag %D July 1980 %K icalp icalp7 icalp80 %P 658-671 %A C.P. Schnorr %T Refined analysis and improvements on some factoring algorithms %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 1-15 %A J. Heintz %A M. Sieveking %T Absolute primality of polynomials is decidable in random polynomial time in the number of the variables %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 16-28 %A F.P. Preparata %A J.E. Vuillemin %T Area-time optimal VLSI networks for computing integer multiplication and discrete Fourier transform %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 29-40 %A J.-W. Hong %A K. Mehlhorn %A A.L. Rosenberg %T Cost tradeoffs in graph embeddings, with applications %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 41-55 %A J.H. Reif %T Minimum S-T cut of a planar undirected network in O(n log^2 n) time %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 56-67 %A W. Welzl %T On the density of color-families %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 68-72 %A C. Beeri %A M.Y. Vardi %T The implication problem for data dependencies %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 73-85 %A J.A. Makowsky %T Characteriziing data base dependencies %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 86-97 %A M. Sharir %T Data flow analysis of applicative programs %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 98-113 %A N.D. Jones %T Flow analysis of lambda expressions %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 114-128 %A J. Loeckx %T Algorithmic specification of abstract data types %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 129-147 %A P.A. Subrahmanyam %T Nondeterminism in abstract data types %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 148-164 %A J.D. Ullman %T A view of directions in relational database theory %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 165-176 %A C. Reutenauer %T A new characterization of the regular languages %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 177-183 %A J.E. Pin %T Langages reconnaissables et codage prefixe pur %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 184-192 %A J. Engelfriet %A G. File %T Passes, sweeps and visits %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 193-207 %A S. Sippu %A E. Soisalon-Soininen %T On LALR(k) testing %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 208-217 %A E. Ukkonen %T On size bounds for deterministic parsers %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 218-228 %A Y. Itzhaik %A A. Yehudai %T A decision procedure for the equivalence of two DPDAs one of which is linear %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 229-237 %A A.R. Meyer %A G. Mirkowska %A R.S. Streett %T The deducibility problem in propositional dynamic logic %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 238-248 %A M. Ben-Ari %A J.Y. Halpern %A A. Pnueli %T Finite models for deterministic propositional dynamic logic %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 249-263 %A D. Lehmann %A A. Pnueli %A J. Stavi %T Impartiality, justice and fairness: the ethics of concurrent termination %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 264-277 %A A.S. Fraenkel %A D. Lichtenstein %T Computing a perfect strategy for n*n chess requires time exponential in n %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 278-293 %A O.H. Ibarra %A B.S. Leininger %A S. Moran %T On the complexity of simple arithmetic expressions %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 294-304 %A M. Snir %T Proving lower bounds for linear decision trees %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 305-315 %A M. Blattner %A M. Latteux %T Parikh-bounded languages %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 316-323 %A J. Karhumaki %T Generalized Parikh mappings and homomorphisms %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 324-332 %A S. Istrail %T Chomsky-Schutzenberger representations for families of languages and grammatical types %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 333-347 %A J.A. Bergstra %A J.V. Tucker %T Algebraically specified programming systems and Hoare's logic %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 348-362 %A M. Moriconi %A R.L. Schwartz %T Automatic construction of verification condition generators from Hoare logics %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 363-377 %A R. Sethi %T Circular expressions: elimination of static environments %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 378-392 %A B. Courcelle %T An axiomatic approach to the Korenjak-Hopcroft algorithms %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 393-407 %A E. Ehrenfeucht %A G. Rozenberg %T On the (generalized) Post correspondence problem with lists of length 2 %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 408-416 %A A. Itai %A A.G. Konheim %A M. Rodeh %T A sparse table implementation of priority queues %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 417-431 %A A. Pettorossi %T Comparing and putting together recursive path ordering, simplification orderings and non-ascending property for termination proofs of term rewriting systems %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 432-447 %A N. Dershowitz %T Termination of linear rewriting systems %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 448-458 %A A. Pnueli %A R. Zarhi %T Relizing an equational specification %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 459-478 %A K.R. Apt %A G.D. Plotkin %T A Cook's tour of countable nondeterminism %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 479-494 %A E.M. Gurari %A O.H. Ibarra %T The complexity of decision problems for finite-turn multicounter machines %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 495-505 %A K.N. King %T Alternating multihead finite automata %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 506-520 %A J. Pearl %T The solution for the branching factor of the alpha-beta pruning algorithm %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 521-529 %A K. Lieberherr %T Uniform complexity and digital signatures %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 530-543 %A A. Shamir %T On the generation of cryptographically strong pseudorandom sequences %J Proceedings of the Eighth International Colloqium on Automata, Languages and Programming %E S. Even %E O. Kariv %C Acre, Israel %O published as Lecture Notes in Computer Science 115 by Springer-Verlag %D July 1981 %K icalp icalp8 icalp81 %P 544-550 %A R.J.R. Back %A H. Mannila %T Locality in modular systems %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 1-13 %A M. Ben-Ari %T On-the-fly garbage collection: new algorithms inspired by program proofs %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 14-22 %A J.A. Bergstra %A J.W. Klop %T Algebraic specifications for parameterized data types with minimal parameter and target algebras %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 23-34 %A K.J. Berkling %A E. Fehr %T A modification of the lambda-calculus as a base for functional programming languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 35-47 %A P. Berman %A J.Y. Halpern %A J. Tiuryn %T On the power of nondeterminism in dynamic logic %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 48-60 %A A. Bertoni %A G. Mauri %A N. Sabadini %T Equivalence and membership problems for regular trace languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 61-71 %A N. Blum %T On the pwer of chain rules in context free grammars %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 72-82 %A P.-J. Brandenburg %T Extended Chomsky-Schutzenberger theorems %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 83-93 %A L. Cardelli %T Real time agents %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 94-106 %A J. Case %A C. Lynes %T Machine inductive inference and language identification %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 107-115 %A G. Comyn %A M. Dauchet %T Approximations of infinitary objects %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 116-127 %A K. Culik,\ II %A J. Karhumaki %T On test sets and the Ehrenfeucht conjecture %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 128-140 %A W. Damm %A A. Goerdt %T An automata-theoretic characterization of the OI-hierarchy %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 141-153 %A D.P. Dobkin %A D.G. Kirkpatrick %T Fast detection of polyhedral intersections %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 154-165 %A P. Duris %A Z. Galil %T On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 166-175 %A P. Duris %A J. Hromkovic %T Multihead finite state automata and concatenation %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 176-186 %A A. Ehrenfeucht %A D. Haussler %A G. Rozenberg %T Conditions enforcing regularity of context-free languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 187-191 %A A. Enrehfeucht %A G. Rozenberg %T Repetitions in homomorphisms and languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 192-196 %A K. Ehrig %A H.-J. Kreowski %T Parameter passing commutes with implementation of parameterized data types %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 197-211 %A A.A. Faustini %T An operational semantics for pure dataflow %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 212-224 %A C. fernandez %A P.S. Thiagarajan %T Some properties of D-continuous causal nets %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 225-238 %A P. Flajolet %A J.-M. Steyaert %T A branching process arising in dynamic hashing, trie searching and polynomial factorization %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 239-251 %A R. Gerth %T A sound and complete Hoare axiomatization of the Ada rendezvous %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 252-264 %A J. Goguen %A J. Meseguer %T Universal realization, persistent interconnection and implementation of abstract modules %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 265-281 %A G.H. Gonnet %A J.I. Munro %T Heaps on heaps %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 282-291 %A A. Goralcikova %A P. Goralcik %A V. Koubek %T A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 292-299 %A J.V. Guttag %A D. Kapur %A D.R. Musser %T Derived pairs, overlap closures, and rewrite dominoes: new tools for analyzing term rewriting systems %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 300-312 %A D. Harel %A D. Kozen %T A programming language for the inductive sets, and applications %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 313-329 %A K.A. Kalorkoti %T A lower bounds for the formula size of rational functions %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 330-338 %A J. Karhumaki %T On the equivalence problem for binary DOL systems %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 339-347 %A D. Kozen %T Results on the propositional mu-calculus %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 348-359 %A Y. Krevner %A A. Yehudai %T An iteration theorem for simple rpecedence languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 360-368 %A A. Lingas %T The power of non-rectilinear holes %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 369-383 %A D. Niwinski %T Fixed-point semantics for algebraic (tree) grammars %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 384-396 %A D. Perrin %T Completing biprefix codes %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 397-406 %A K. Pippenger %T Advances in pebbling %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 407-417 %A G.D. Plotkin %T A powerdomain for countable non-determinism %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 418-428 %A J.C. Raoult %A R. Sethi %T Properties of a notation for combining functions %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 429-441 %A J.H. Reif %T On the power of probabilistic choice in synchronous parallel computations %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 442-450 %A C. Reutenauer %T Biprefix codes and semisimple algebras %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 451-457 %A A. Salwicki %T Algorithmic theories of data structures %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 458-472 %A D. Sannella %A M. Wirsing %T Implementation of parameterised specifications %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 473-488 %A H. Schmeck %T Algebraic semantics of recursive flowchart schemes %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 489-501 %A A.L. Selman %A Y. Yacobi %T The complexity of promise problem %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 502-509 %A J. Sifakis %T Global and local invariants in transition systems %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 510-522 %A M. Sipser %T On relativization and the existence of complete sets %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 523-531 %A R.D. Tennent %T Semantics of interference control %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 532-545 %A P.M.B. Vitanyi %T Efficient simulations of multicounter machines %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 546-560 %A G. Winskel %T Event structure semantics for CCS and related languages %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 561-576 %A D. Scott %T Domains for denotational semantics %J Proceedings of the Ninth International Colloqium on Automata, Languages and Programming %E M. Nielsen %E E.M. Schmidt %C Aarhus, Denmark %O published as Lecture Notes in Computer Science 140 by Springer-Verlag %D July 1982 %K icalp icalp9 icalp82 %P 577-613 %A Samson Abramsky %T On semantic foundations for applicative multiprogramming %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 1-14 %A Krzysztof R. Apt %A Carole Delporte %T An axiomatization of the intermittent assertion method using temporal logic (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 15-27 %A Andre Arnold %T Topological characterizations of infinite behaviours of transition systems %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 28-38 %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 Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 39-51 %A J.W. de\ Bakker %A J.I. Zucker %T Processes and a fair semantics for the Ada rendez-vous %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 52-66 %A P. De\ Bra %A J. Paredaens %T Conditional dependencies for horizontal decompositions %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 67-82 %A Stephen D. Brookes %T On the relationship of CCS and CSP %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 83-96 %A Stephen D. Brookes %A William C. Rounds %T Behavioral equivalence relations induced by programming logics %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 97-108 %A Ashok K. Chandra %A Steven Fortune %A Richard Lipton %T Lower bounds for constant depth circuits for prefix problems %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 109-117 %A Christian Choffrut %A Juhani Karhumaki %T Test sets for morphisms with bounded delay %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 118-127 %A Shimon Cohen %A Daniel Lehmann %A Amir Pnueli %T Symmetric and economical solutions to the mutual exclusion problem in a distributed system (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 128-136 %A Karel Culik,\ II %A Arto Salomaa %T Ambiguity and decision problems concerning number systems %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 137-146 %A Ph. Darondeau %A L. Kott %T On the observational semantics of fair parallelism %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 147-159 %A Frank Dehne %T An O(N^4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 160-172 %A M.P. Delest %A G. Viennot %T Algebraic languages and polyominoes enumerations %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 173-181 %A Herbert Edelsbrunner %A Emmerich Welzl %T On the number of equal-size semispaces of a set of points in the plane (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 182-187 %A H. Ehrig %A E.G. Wagner %A J.W. Thatcher %T Algebraic specifications with generating constraints %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 188-202 %A Aviezri S. Fraenkel %T Wythoff games, continued fractions, cedar trees and Fibonacci searches %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 203-225 %A J. Gabarro %T Initial index: a new complexity function for languages %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 226-236 %A Harald Ganzinger %T Modular compiler descriptions based on abstract semantic data types (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 237-249 %A J. von\ zur^ Gathen %A E. Kaltofen %T Polynomial-time factorization of multivariate polynomials over finite fields %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 250-263 %A U. Goltz %A W. Reisig %T Processes of place/transition-nets %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 264-277 %A Joseph Halpern %A Zohar Manna %A Ben Moszkowski %T A hardware semantics based on temporal intervals %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 278-291 %A Susanne E. Hambrusch %A Janos Simon %T Lower bounds for solving undirected graph problems on VLSI %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 292-303 %A Sergiu Hart %A Micha Sharir %T Concurrent probabilistic program, or: how to schedule if you must %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 304-318 %A J. Hartmanis %A Y. Yesha %T Computation times of NP sets of different densities %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 319-330 %A Jieh Hsiang %A Nachum Dershowitz %T Rewrite methods for clausal and non-clausal theorem proving %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 331-346 %A K. Indermark %T Complexity of infinite trees %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 347-360 %A Jean-Pierre Jouannaud %A Claude Kirschner %A Helene Kirschner %T Incremental construction of unification algorithms in equational theories %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 361-373 %A Tsutomu Kamimura %T Tree automata and attribute grammars %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 374-384 %A T. Kamimura %A A. Tang %T Effectively given spaces %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 385-396 %A Juhani Karhumaki %T A note on intersections of free submonoids of a free monoid %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 397-407 %A Hans-Werner Lang %A Manfred Schimmler %A Hartmut Schmeck %A Heiko Schroder %T A fast sorting algorithm for VLSI %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 407-419 %A M. Latteux %A J. Leguy %T On the composition of morphisms and inverse morphisms %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 420-432 %A Evelyne Le\ Rest %A Stuart W. Margolis %T On the group complexity of a finite language %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 433-444 %A Daniel Lehmann %A Saharon Shelah %T Reasoning with time and chance (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 445-457 %A A.K. Lenstra %T Factoring multivariate integral polynomials %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 458-465 %A P. Lescanne %A J.M. Steyaert %T On the study data structures: binary tournaments with repeated keys %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 466-477 %A F.S. Makedon %A I.H. Sudborough %T Minimizing width in linear layouts %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 478-490 %A Zohar Manna %A Amir Pnueli %T Proving precedence properties: the temporal way %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 491-512 %A Bernhard Moller %T An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 513-526 %A J. Ian Munro %A Patricio V. Poblete %T Searchability in merging and implicit data structures %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 527-535 %A A. Mycroft %A F. Nielson %T String abstract interpretation using power domains (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 536-547 %A R. de\ Nicola %A M.C.B. Hennessy %T Testing equivalences for processes %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 548-560 %A E.-R. Olderog %A C.A.R. Hoare %T Specification-oriented semantics for communicating processes %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 561-572 %A Pekka Orponen %T Complexity classes of alternating machines with oracles %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 573-584 %A Jean-Jacques Pansiot %T A propos d'une conjecture de F. Dejean sur les repetitions dans les mots %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 585-596 %A W. Paul %A U. Vishkin %A R. Wagener %T Parallel dictionaries on 2-3 trees %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 597-609 %A Dominique Perrin %T Varietes de semigroupes et mots infinis %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 610-616 %A Jean-Eric Pin %T Arbres et hierarchies de concatenation %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 617-628 %A John Reif %A Aravinda Prasad Sistla %T A multiprocess network logic with temporal and stapial modalities %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 629-639 %A Taisuke Sato %A Hisao Tamaki %T Enumeration of success patterns in logic programs %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 640-652 %A Uwe Schoning %A Ronald V. Book %T Immunity (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 653-661 %A M.B. Smyth %T Power domains and predicate transformers: a topological view %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 662-675 %A Jeremy Spinrad %A Jacobo Valdes %T Recognition and isomorphism of two dimensional partial orders %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 676-686 %A Paul M.B. Vitanyi %T On the simulation of many storage heads by a single one %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 687-694 %A Glynn Winskel %T Synchronisation trees %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 695-711 %A Mihalis Yannakakis %A Paris C. Kanellakis %A Stavros S. Cosmadakis %A Christos H. Papadimitriou %T Cutting and partitioning a graph after a fixed pattern (extended abstract) %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 712-722 %A Klaus-Jorgen Lange %T Context-free controlled ETOL systems %J Proceedings of the Tenth International Colloqium on Automata, Languages and Programming %E J. Diaz %C Barcelona, Spain %O published as Lecture Notes in Computer Science 154 by Springer-Verlag %D July 1983 %K icalp icalp10 ialp83 %P 723-733 %A Ronald Fagin %A Moshe Y. Vardi %T The theory of data dependencies - an overview %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 1-22 %A Arnold L. Rosenberg %T The VLSI revolution in theoretical circles %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 23-40 %A Serge Abiteboul %A Seymour Ginsburg %T Tuple sequences and indexes %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 41-50 %A Foto Afrati %A Christos H. Papadimitriou %A George Papageorgiou %T The complexity of cubical graphs %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 51-57 %A Klaus Ambos-Spies %A Hans Fleischack %A Hagen Huwig %T P-generic sets %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 58-68 %A Paolo Atzeni %A Nicola M. Morfuni %T Functional dependecies and disjunctive existence constraints in database relations with null values %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 69-81 %A J.A. Bergstra %A J.W. Klop %T The algebra of recursively defined processes and the algebra of regular processes %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 82-94 %A Michel Bidoit %T Algebraic specification of exception handling and error recovery by means of declarations and equations %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 95-108 %A A. Blumer %A J. Blumer %A A. Ehrenfeucht %A D. Haussler %A R. McConnell %T Building the minimal DFA for the set of all subwords of a word on-line in linear time %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 109-118 %A Bernard Chazelle %A Thomas Ottmann %A Eljas Soisalon-Soininen %A Derick Wood %T The complexity and decidability of separation %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 119-127 %A Charles J. Colbourn %A Andrzej Proskurowski %T Concurrent transmissions in broadcast networks %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 128-136 %A Max Crochemore %T Linear searching for a square in a word %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 137-150 %A Didier Ferment %T Principality results about some matrix languages families %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 151-161 %A L. Fribourg %T Oriented equational clauses as a programming language %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 162-173 %A Daniele Gardy %A Claude Puech %T Relational algebra operations and sizes of relations %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 174-186 %A Daniele Girault-Beauquier %T Some results about finite and infinite behaviours of a pushdown automaton %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 187-195 %A Ursula Goltz %A Alan Mycroft %T On the relationship of CCS and Petri nets %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 196-208 %K calculus of communicating systems %A M.G. Gouda %A L.E. Rosier %T Communicating finite state machines with priority channels %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 209-221 %A S. Graf %A J. Sifakis %T A modal characterization of observational congruence on finite terms of CCS %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 222-234 %K calculus of communicating systems %A Juraj Hromkovic %T Communication complexity %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 235-246 %A Oscar H. Ibarra %A Sam M. Kim %A Louis E. Rosier %T Space and time efficient simulations and characterizations of some restricted classes of PDAs %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 247-259 %A Hiroyuki Izumi %A Yasuyoshi Imagaki %A Namio Honda %T A complete axiom system for algebra of closd-regular expression %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 260-269 %A Mark Jerrum %T The complexity of finding minimum-length generator sequences (extended abstract) %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 270-280 %A Hermann Jung %T On probabilistic tape complexity and fast circuits for matrix inversion problems %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 281-291 %A Juhani Karhumaki %T On three-element codes %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 292-302 %A Peter Kirschenhofer %A Helmut Prodinger %T Recursion depth analysis for special tree traversal algorithms %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 303-311 %A J.C. Lagarias %T Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 312-323 %A Heikki Mannila %T Measures of presortedness and optimal sorting algorithms %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 324-336 %A S.W. Margolis %A J.E. Pin %T Languages and inverse semigroups %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 337-346 %A K. Mehlhorn %A F.P. Preparata %T Area-time optimal VLSI integer multiplier with minimum computation time %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 347-357 %A M.A. Nait Abdallah %T On the interpretation of infinite computations in logic programming %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 358-370 %A Robert Paige %A Robert E. Tarjan %T A linear time algorithm to solve the single function coarsest partition problem %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 371-379 %A Jean-Jacques Pansiot %T Complexite des facteurs des mots infinis engendres par morphismes iteres %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 380-389 %A J.P. Pecuchet %T Automates Boustrophedon, semi-groupe de Birget et monoide inversif libre (abstract only) %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 390 %A John Reif %A Paul Spirakis %T Probabilistic bidding gives optimal distributed resource allocation %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 391-402 %A Wolfgang Reisig %T Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 403-413 %A Antonio Restive %A Chritophe Reutenauer %T Cancellation, pumping and permutation in formal languages %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 414-422 %A Dorit Ron %A Flavia Rosemberg %A Amir Pnueli %T A hardware implementation of the CSP primitives and its verification %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 423-435 %A Arnold Schonhage %T Factorizatiuon of univariate integer polynomials by Diophantine approximation and an improved basis reduction algorithm %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 436-447 %A Uwe Schoning %T Robust algorithms: a different approach to oracles (extended abstract) %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 448-453 %A Thomas H. Spencer %A Ernst W. Mayr %T Node wighted matching %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 454-464 %A Robert S. Streett %A E. Allen Emerson %T The propositional mu-calculus is elementary %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 465-472 %A Athanasios K. Tsakalidis %T AVL-tree for localized search %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 473-485 %A Paul M.B. Vitanyi %T The simple roots of real-time computation hierarchies (preliminary version) %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 486-489 %A Jeffrey Scott Vitter %T Computational complexity of an optical disk interface %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 490-502 %A Emo Welzl %T Encoding graphs by derivations and implications for the theory of graph grammars %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 503-513 %A Dan E. Willard %T Sampling algorithms for differential batch retrieval problems (extended abstract) %J Proceedings of the Eleventh International Colloqium on Automata, Languages and Programming %E Jan Paredaens %C Antwerp, Belgium %D July 1984 %O published as Lecture Notes in Computer Science 172 by Springer-Verlag %K icalp icalp11 icalp84 %P 514-526 %A L.Lovasz %T Vertex packing algorithms %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 1-14 %A Amir Pnueli %T Linear and branching structures in the semantics and logics of reactive systems %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 15-32 %A D. Beauquier %A M. Nivat %T About rational sets of factors of a bi-definite word %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 33-42 %A Michael Ben-Or %A Oded Goldreich %A Silvio Micali %A Ronald L. Rivest %T A fair protocol for signing contracts %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 43-52 %A G. Bilardi %A F.P. Preparata %T The influence of key length on the area-time complexity of sorting %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 53-62 %A Luc Bouge %T Repeated synchronous snapshots and their implementation in CSP %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 63-70 %A W. Bucher %A A. Ehrenfeucht %A D. Haussler %T On total regulators generated by derivation relations %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 71-79 %A Bernard Chazelle %A Herbert Edelsbrunner %T Optimal solutions for a class of point retrieval problems %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 80-89 %A Bernard Chazelle %A Leonidas J. Guibas %T Fractional cascading: a data structuring technique with geometric applications (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 90-100 %A Marek Chrobak %T Hierarchies of one-way multihead automata languages %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 101-110 %A Richard Cole %T Partitioning point sets in 4 dimensions %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 111-119 %A M. Coppo %T A completeness theorem for recursively defined types %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 120-129 %A P.-L. Curien %T Categorical combinatory logic %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 130-139 %A J.W. de\ Bakker %A J.N. Kok %T Towards a uniform topological treatment of streams and functions on streams %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 140-148 %A J.W. de\ Bakker %A J.-J.Ch. Meyer %A E.-R. Olderog %T Infinite streams and finite observations in the semantics of uniform concurrency %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 149-157 %A P. de\ Bra %T Imposed-functional dependencies inducing horizontal decompositions %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 158-170 %A Joost Engelfriet %A Heiko Vogler %T Characterization of high level tree transducers %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 171-178 %A Philippe Flajolet %T Ambiguity and transcendence %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 179-188 %A S.J. Fortune %T A fast algorithm for polygon containment by translation (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 189-198 %A Martin Furer %T Deterministic and Las Vegas primality testing algorithms %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 199-209 %A Harold N. Gabow %A Matthias Stallmann %T Efficient algorithms for graphic matroid intersection and parity (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 210-220 %A Joseph A. Goguen %A Jean-Pierre Jouannaud %A Jose Meseguer %T Operational semantics for order-sorted algebra %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 221-231 %A Carl A. Gunter %T A universal domain technique for profinite posets %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 232-243 %A G. Hansel %T A simple proof of the Skolem-Mahler-Lech theorem %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 244-249 %A Juris Hartmanis %A Neil Immerman %T On complete problems for NP intersect CoNP %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 250-259 %A Mathew Hennessy %T An algebraic theory of fair asynchronous communicating processes %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 260-269 %A M.-T. Hortala-Gonzalez %A M. Rodriguez-Artalejo %T Hoare's logic for nondeterministic reguler programs: a nonstandard completeness theorem %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 270-280 %A Karel Hrbacek %T Powerdomains as algebraic lattices (preliminary report) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 281-289 %A Mark Jerrum %T Random generation of combinatorial structures from a uniform distribution (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 290-299 %A J.H. Johnson %T Do rational equivalence relations have regular cross-sections ? %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 300-309 %A Hermann Jung %T On probabilistic time and space %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 310-317 %A Rolf G. Karlsson %A J. Ian Munro %A Edward L. Robertson %T The nearest neighbor problem on bounded domains %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 318-327 %A Michael Kaufmann %A Kurt Mehlhorn %T Routing thorugh a generalized switchbox %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 328-337 %A Veikko Keranen %T On k-repetition free words generated by length uniform morphisms over a binary alphabet %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 338-347 %A Juha Kortelainen %T Every commutative quasirational language is regular %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 348-355 %A Thomas G. Kurtz %A Udi Manber %T A probabilistic distributed algorithm for set intersection and its analysis (preliminary version) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 356-362 %A Gad M. Landau %A Mordechai M. Yung %A Zvi Galil %T Distributed algorithms in synchronous broadcasting networks %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 363-372 %A Kim Guldstrand Larsen %T A context dependent equivalence between processes %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 373-382 %A Ming Li %T Lower bounds by Kolmogorov-complexity (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 383-393 %A Michael Luby %A Prabhaka Ragde %T A bidirectional shortest-path algorithm with good average-case behavior (preliminary version) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 394-403 %A Michael G. Main %A Walter Bucher %A David Haussler %T Applications of an infinite square-free co-CFL %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 404-412 %A Zohar Manna %A Richard Waldinger %T Special relations in automated deduction %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 413-423 %A Kurt Mehlhorn %A Athanasios Tsakalidis %T Dynamic interpolation search %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 424-434 %A Pekka Orponen %A David A. Russo %A Uwe Schoning %T Polynomial levelability and maximal complexity cores %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 435-444 %A J.E. Pin %T Finite group topology and p-adic topology for free monoids %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 445-455 %A Seppo Sippu %A Eljas Soisalon-Soininen %T On the use of relational expressions in the design of efficient algorithms %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 456-464 %A A. Prasad Sistla %A Moshe Y. Vardi %A Pierre Wolper %T The complementation problem for Buchi auomata with applications to temporal logic (extended abstract) %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 465-474 %A Colin Stirling %T A complete compositional modal proof system for a subset of CCS %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 475-486 %A P.J. Varman %A I.V. Ramakrishnan %T On matrix multiplication using array processors %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 487-496 %A Uzi Vishkin %T Optimal parallel pattern matching in strings %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 497-508 %A Job Zwiers %A Willem Paul de\ Roever %A Peter van\ Emde\ Boas %T Compositionality and concurrent networks: soundness and completeness of a proofsystem %J Proceedings of the Twelfth International Colloqium on Automata, Languages and Programming %E Wilfried Brauer %C Nafplion, Greece %D July 1985 %O published as Lecture Notes in Computer Science 194 by Springer-Verlag %K icalp icalp12 icalp85 %P 509-519 %A E.W. Allender %T Characterizations of PUNC and precomputation %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 1-10 %A D. Arques %A J. Francon %A M.T. Guichet %T Comparison of algorithms controlling concurrent access to a database: a combinatorial approach %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 11-20 %A F. Aurenhammer %T A new duality result concerning Voronoi diagrams %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 21-30 %A A. Averbuch %A Z. Galil %A S. Winograd %T Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 31-39 %A R. Book %A P. Orponen %A D. Russo %A O. Watanabe %T On exponential lowness %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 40-49 %A A. Borodin %A F.E. Fich %A F. Weyer\ auf\ der\ Heide %A E. Upfal %A A. Wigderson %T A tradeoff between search and update time for the implicit dictionary problem %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 50-59 %A F.J. Brandenburg %T Intersections of some families of languages %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 60-68 %A J.A. Brzozowski %A C-J. Seger %T Correspondence between ternary simulation and binary race analysis in gate networks %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 69-78 %A C. Choffrut %A M.P. Schutzenberger %T Counting with rational functions %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 79-88 %A C. De\ Felice %T Finite biprefix sets of paths in a graph %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 89-94 %A P.W. Dymond %A W.L. Ruzzo %T Parallel RAMs with owned global memory and deterministic context-free language recognition %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 95-104 %A L. Fribourg %T A strong restriction of the inductive completion procedure %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 105-115 %A P. Goralcik %A V. Koubek %T On discerning words by automata %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 116-122 %A J. Hartmanis %A L. Hemachandra %T Complexity classes without machines: on complete languages for UP %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 123-135 %A J. Hartmanis %A M. Li %A Y. Yesha %T Containment separation, complete sets, and immunity of complexity classes %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 136-145 %A M. Hermann %A I. Privara %T On nontermination of Knuth-Bendix algorithm %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 146-156 %A J. Hromkovic %T Tradeoffs for language recognition on parallel computing models %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 157-166 %A J.H. Johnson %T Rational equivalence relations %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 167-176 %A P. Kirschenhofer %A H. Prodinger %T Some further results on digital search trees %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 177-185 %A S. Kraus %A D. Lehmann %T Knowledge, belief and time %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 186-195 %A T.H. Lai %T A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 196-205 %A K.J. Lange %T Decompositions of nondeterministic reductions %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 206-214 %A T. Lengauer %T Hierarchical planarity testing algorithms %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 215-225 %A B. Lisper %T Synthesis and equivalence of concurrent systems %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 226-235 %A J. Mannila %A E. Ukkonen %T The set union problem with backtracking %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 236-243 %A J.P. Mascle %T Torsion matrix semigroups and recognizable transductions %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 244-253 %A Y. Metivier %T On recognizable subsets of free partially commutative monoids %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 254-264 %A B. Monien %A I.H. Sudborough %T Min cut is NP-complete for edge weighted trees %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 265-274 %A D.E. Muller %A A. Saoudi %A P.E. Schupp %T Alternating automata, the weak monadic theory of the tree, and its complexity %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 275-283 %A N.Th. Muller %T Subpolynomial complexity classes of real functions and real numbers %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 284-293 %A J.P. Pecuchet %T Etude syntaxique des parties reconnaissables de mots infinis %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 294-303 %A I. Phillips %T Refusal testing %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 304-313 %A G.M. Reed %A A.W. Roscoe %T A timed model for communicating sequential processes %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 314-323 %A K.W. Regan %T A uniform reduction theorem extending a result of J. Grollman and A. Selman %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 324-333 %A L.E. Rosier %A H.C. Yen %T On the complexity of deciding fair termination of probabilistic concurrent finite-state programs %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 334-343 %A N. Shavit %A N. Francez %T A new approach to detection of locally indicative stability %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 344-358 %A C.P. Schnorr %T A more efficient algorithm for lattice basis reduction %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 359-369 %A U. Schoning %T Lower bounds by recursion theoretic arguments %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 370-375 %A K. Simon %T An improved algorithm for transitive closure on acyclic digraphs %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 376-386 %A J.C. Spehner %T Un algorithme determinant les melanges de deux mots %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 387-396 %A P. Spirakis %A A. Tsakalidis %T A very fast, practical algorithm for finding a negative cycle in a digraph %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 397-406 %A C. Stirling %T A compositional reformulation of Owicki-Gries's partial correctness algorithm for a concurrent while language %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 407-415 %A H. Strabing %T Semigroups and languages of dot-depth 2 %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 416-423 %A P. Varman %A K. Doshi %T A parallel vertex insertion algorithm for minimum spanning trees %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 424-433 %A K.W. Wagner %T More complicated questions about maxima and minima, and some closures of NP %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 434-443 %A D.E. Willard %T Lower bounds for dynamic range query problems that permit subtraction %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 444-453 %A J.H. You %A P.A. Subrahmanyam %T E-unification algorithms for a class of confluent term rewriting systems %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 454-463 %A D. Niwinski %T On fixed-point clones %J Proceedings of the Thirteenth International Colloqium on Automata, Languages and Programming %E Laurent Kott %C Rennes, France %D July 1986 %O published as Lecture Notes in Computer Science 226 by Springer-Verlag %K icalp icalp13 icalp86 %P 464-473 %A L. Pitt %A C.H. Smith %T Probability and plurality for aggregations of learning machines %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 1-10 %A M.A. Nait Abdallah %T Logic programming with ions %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 11-20 %A P. Dybjer %T Computing inverse images %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 21-30 %A S. Hoelldobler %T A unification algorithm for confluent theories %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 31-41 %A V. Diekert %T On the Knuth-Bendix completion for concurrent processes %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 42-53 %A J. Hsiang %A M. Rusinowitch %T On word problems in equational theories %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 54-71 %A R.K. Shyamasundar %A K.T. Narayana %A T. Pitassi %T Semantics for nondeterministic asynchronous broadcast networks %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 72-83 %A J.C.M. Baeten %A R.J. van\ Glabbeek %T Another look at abstraction in process algebra %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 84-94 %A R. Gerth %A A. Boucher %T A timed failures model for extended communicating processes %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 95-114 %A S. Graf %A J. Sifakis %T Readiness semantics for regular processes with silent actions %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 115-125 %A K.G. Larsen %A R. Milner %T Verifying a protocol using relativized bisimulation %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 126-135 %A J. Karhumaeki %T On recent trends in formal language theory %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 136-162 %A D.A. Barrington %A D. Therien %T Non-uniform automata over groups %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 163-173 %A D. Beauquier %T Minimal automaton of a rational cover %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 174-189 %A C. Choffrut %A C. Duboc %T A star-height problem in free monoids with partial commutations %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 190-201 %A J.H. Johnson %T Single-valued finite transduction %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 202-211 %A W. Kuich %T The Kleene and the Parikh theorem in complete semirings %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 212-225 %A Y. Metivier %T An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 226-236 %A J.E. Pin %T On the languages accepted by finite reversible automata %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 237-249 %A I.J. Aalbersberg %A H.J. Hoogeboom %T Decision problems for regular trace languages %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 250-259 %A M.P. Chytil %A J. Demner %T Panic mode without panic %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 260-268 %A T. Hafer %A W. Thomas %T Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 260-279 %A B. Josko %T Modelchecking of CTL formulae under liveness assumptions %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 280-289 %A K. Lodaya %A P.S. Thiagarajan %T A modal logic for a subclass of event structures %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 290-303 %A T. Hagerup %T Parallel 5-colouring of planar graphs %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 304-313 %A G.M. Landau %A B. Schieber %A U. Vishkin %T Parallel construction of a suffix tree %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 314-325 %A M. Li %A Y. Yesha %T The probabilistic and deterministic parallel complexity of symmetric functions %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 326-335 %A R. Ramesh %A R.M. Verma %A T. Krishnaprasad %A I.V. Ramakrishnan %T Term matching on parallel computers %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 336-346 %A J.E. van\ Leeuwen %A N. Santoro %A J. Urrutia %A S. Zaks %T Guessing games and distributed computations in synchronous networks %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 347-356 %A J.T. Schwartz %A M. Sharir %T On the bivariate function minimalization problem and its application to motion planning %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 357-363 %A H. Edelsbrunner %A G. Rote %A E. Welzl %T Testing the necklace condition for shortest tours and optimal factors in the plane %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 364-375 %A C. Levcopoulos %A A. Lingas %A J.-R. Sack %T Nearly optimal heuristics for binary search trees with geometric generalizations %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 376-385 %A A. Paz %A C.P. Schnorr %T Approximating integer lattices by lattices with cyclic factor groups %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 386-393 %A J. Cai %A G.E. Meyer %T On the complexity of graph critical uncolorability %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 394-403 %A G. Gambosi %A J. Nesetril %A M. Talamo %T Posets, boolean representations and quick path searching %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 404-424 %A S. Miyano %T The lexicographically first maximal subgraph problems: P-completeness and NC algorithms %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 425-434 %A N.Th. Mueller %T Uniform computational complexity of Taylor series %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 435-444 %A A. Marchetti-Spaccamela %A C. Vercellis %T Efficient on-line algorithms for the knapsack problem %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 445-456 %A M. Dietzfelbinger %T Lower bounds for sorting of sums %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 457-466 %A A. Aggarwal %A J.S. Vitter %T The I/O complexity of sorting and related problems %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 467-478 %A K. Mehlhorn %A S. Naeher %A H. Alt %T A lower bound for the complexity of the union-split-find problem %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 479-488 %A A.K. Tsakalidis %T The nearest common ancestor in a dynamic tree %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 489-498 %A A. Finkel %T A generalization of the procedure of Karp and Miller to well structured transition systems %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 499-508 %A R.R. Howell %A L.E. Rosier %T Completeness results for reachability, containment, and equivalence with respect to conflict-free vector replacement systems %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 509-520 %A H.J. Kreowski %T Partial algebras flow from algebraic specifications %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 521-530 %A K.J. Lange %A B. Jenner %A B. Kirsig %T The logarithmic alternation hierarchy collapses %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 531-541 %A M. Beaudry %T Testing membership in commutative transformation semigroups %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 542-549 %A O.H. Ibarra %A T. Jiang %T On the computing power of one-way cellular arrays %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 550-562 %A L. Valiant %T Recent developments in the theory of learning (abstract only) %J Proceedings of the Fourteenth International Colloqium on Automata, Languages and Programming %E Thomas Ottman %C Karlsruhe, West Germany %D July 1987 %O published as Lecture Notes in Computer Science 267 by Springer-Verlag %K icalp icalp14 icalp87 %P 563