Automata, Languages and programming. 18th international colloquium, Madrid, Spain, July 8-12, 1991. Proceedings (Q1202060)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Gabbrielli, Maurizio; Levi, Giorgio}, On the semantics of logic programs, 1-19 [Zbl 0769.68013] \textit{Chen, Hong; Hsiang, Jieh}, Logic programming with recurrence domains, 20-34 [Zbl 0772.68017] \textit{Bucciarelli, Antonio; Ehrhard, Thomas}, Extensional embedding of a strongly stable model of PCF, 35-46 [Zbl 0786.68053] \textit{Ernoult, Christine; Mycroft, Alan}, Uniform ideals and strictness analysis, 47-59 [Zbl 0786.68054] \textit{Breazu-Tannen, Val; Subrahmanyam, Ramesh}, Logical and computational aspects of programming with sets/bags/lists, 60-75 [Zbl 0769.68080] \textit{Bouajjani, A.; Fernandez, J. C.; Graf, S.; Rodriguez, C.; Sifakis, J.}, Safety for branching time semantics, 76-92 [Zbl 0769.68089] \textit{Fix, Limor; Francez, Nissim; Grumberg, Orna}, Program composition and modular verification, 93-114 [Zbl 0769.68093] \textit{Alur, Rajeev; Courcoubetis, Costas; Dill, David}, Model-checking for probabilistic real-time systems, 115-126 [Zbl 0769.68088] \textit{Cleaveland, Rance; Steffen, Bernhard}, Computing behavioural relations, logically, 127-138 [Zbl 0769.68024] \textit{Ben-Asher, Y.; Peleg, D.; Ramaswami, R.; Schuster, A.}, The power of reconfiguration, 139-150 [Zbl 0769.68023] \textit{Fouks, Jean-Denis}, General resolution of Tseitin formulas is hard, 151-162 [Zbl 0764.68116] \textit{Kannan, Sampath; Yao, Andrew}, Program checkers for probability generation, 163-173 [Zbl 0786.68062] \textit{Kaņeps, Jānis; Freivalds, Rūsiņš}, Running time to recognize nonregular languages by 2-way probabilistic automata, 174-185 [Zbl 0766.68098] \textit{Casas, R.; Díaz, J.; Martinez, C.}, Statistic on random trees, 186-203 [Zbl 0764.68109] \textit{Larsen, Kim Guldstrand}, The expressive power of implicit specifications, 204-216 [Zbl 0785.68062] \textit{Yi, Wang}, CCS + Time = an interleaving model for real time systems, 217-228 [Zbl 0769.68027] \textit{Diekert, Volker; Ochmanski, Edward; Reinhardt, Klaus}, On confluent semi-commutations -- decidability and complexity results, 229-241 [Zbl 0769.68057] \textit{Duchamp, Gérard; Krob, Daniel}, Lazard's factorizations of free partially commutative monoids, 242-253 [Zbl 0766.68075] \textit{Gastin, Paul; Petit, Antoine; Zielonka, Wieslaw}, A Kleene theorem for infinite trace languages, 254-266 [Zbl 0766.68076] \textit{Dershowitz, Nachum}, Canonical sets of Horn clauses, 267-278 [Zbl 0785.68079] \textit{Madlener, K.; Narendran, P.; Otto, F.}, A specialized completion procedure for monadic string-rewriting systems presenting groups, 279-290 [Zbl 0769.68061] \textit{Curien, Pierre-Louis; Di Cosmo, Roberto}, A confluent reduction for the \(\lambda\)-calculus with surjective pairing and terminal object, 291-302 [Zbl 0769.68056] \textit{Fernando, Tim}, Provably recursive programs and program extraction, 303-313 [Zbl 0769.68092] \textit{Lengauer, T.; Theune, D.}, Efficient algorithms for path problems with general cost criteria, 314-326 [Zbl 0764.68123] \textit{Djidjev, Hristo N.; Pantziou, Grammati E.; Zaroliagis, Christos D.}, Computing shortest paths and distances in planar graphs, 327-338 [Zbl 0764.68113] \textit{Galil, Zvi; Italiano, Giuseppe F.}, Maintaining biconnected components of dynamic planar graphs, 339-350 [Zbl 0764.68117] \textit{Loebl, Martin}, Efficient maximal cubic graph cuts, 351-362 [Zbl 0764.68126] \textit{Vishkin, Uzi}, Structural parallel algorithmics, 363-380 [Zbl 0769.68026] \textit{Ranjan, Desh; Chari, Suresh; Rohatgi, Pankaj}, Improving known solutions is hard, 381-392 [Zbl 0786.68045] \textit{Hemachandra, Lane A.; Hoene, Albrecht}, Collapsing degrees via strong computation, 392-404 [Zbl 0769.68029] \textit{Hagerup, Torben}, Fast parallel generation of random permutations, 405-416 [Zbl 0769.68036] \textit{Jung, Hermann; Serna, Maria; Spirakis, Paul}, A parallel algorithm for two processors precedence constraint scheduling, 417-428 [Zbl 0769.68007] \textit{Fürer, Martin; Raghavachari, Balaji}, An efficient \(NC\) algorithm for finding Hamiltonian cycles in dense directed graphs, 429-440 [Zbl 0764.68049] \textit{Thomas, Wolfgang}, On logics, tilings, and automata, 441-454 [Zbl 0769.68100] \textit{Jouannaud, Jean-Pierre; Okada, Mitsuhiro}, Satisfiability of systems of ordinal notations with the subterm property is decidable, 455-468 [Zbl 0789.68125] \textit{Comon, Hubert}, Complete axiomatizations of some quotient term algebras, 469-480 [Zbl 0772.03015] \textit{Bol, Roland; Groote, Jan Friso}, The meaning of negative premises in transition system specifications, 481-494 [Zbl 0796.68142] \textit{Vogler, Walter}, Deciding history preserving bisimilarity, 495-505 [Zbl 0769.68106] \textit{Aceto, Luca; Hennessy, Matthew}, Adding action refinement to a finite process algebra, 506-519 [Zbl 0786.68055] \textit{Bini, Dario; Gemignani, Luca; Pan, Victor}, Improved parallel computations with matrices and polynomials, 520-531 [Zbl 0772.68060] \textit{Lagergren, Jens; Arnborg, Stefan}, Finding minimal forbidden minors using a finite congruence, 532-543 [Zbl 0764.68122] \textit{Bodlaender, Hans L.; Kloks, Ton}, Better algorithms for the pathwidth and treewidth of graphs, 544-555 [Zbl 0764.68108] \textit{Cucker, F.; Torrecillas, A.}, Two P-complete problems in the theory of the reals, 556-565 [Zbl 0785.68038] \textit{Honkala, Juha; Salomaa, Arto}, L morphisms: Bounded delay and regularity of ambiguity, 566-574 [Zbl 0766.68078] \textit{Bruyere, Véronique; De Felice, Clelia}, Degree and decomposability of variable-length codes, 575-587 [Zbl 0766.68071] \textit{Wilke, Thomas}, An Eilenberg theorem for \(\infty\)-languages, 588-599 [Zbl 0766.68083] \textit{Culik, Karel II.; Dube, Simant}, Balancing order and chaos in image generation, 600-614 [Zbl 0769.68120] \textit{Gurevich, Yuri}, Average case complexity, 615-628 [Zbl 0766.68041] \textit{Jiang, Tao; Ravikumar, B.}, Minimal NFA problems are hard, 629-640 [Zbl 0766.68063] \textit{Hashiguchi, Kosaburo}, Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language, 641-648 [Zbl 0766.68077] \textit{Bhattacharya, Binay; Toussaint, Godfried}, Computing shortest transversals, 649-660 [Zbl 0769.68117] \textit{Chazelle, Bernard; Edelsbrunner, Herbert; Grigni, Michelangelo; Guibas, Leonidas; Hershberger, John; Sharir, Micha; Snoeyink, Jack}, Ray shooting in polygons using geodesic triangulations, 661-673 [Zbl 0769.68119] \textit{Bern, Marshall; Eppstein, David; Yao, Frances}, The expected extremes in a Delaunay triangulation, 674-685 [Zbl 0769.68116] \textit{Chazelle, Bernard}, Computational geometry for the gourmet. Old fare and new dishes, 686-696 [Zbl 0772.68097] \textit{Ďuriš, Pavol; Galil, Zvi}, On the power of multiple reads in a chip, 697-706 [Zbl 0769.68052] \textit{Gröger, Hans Dietmar; Turán, György}, On linear decision trees computing Boolean functions, 707-718 [Zbl 0769.68044] \textit{Galil, Zvi; Margalit, Oded}, An almost linear-time algorithm for the dense subset-sum problem, 719-727 [Zbl 0769.68043] \textit{Khuller, Samir; Mitchell, Stephen G.; Vazirani, Vijay V.}, On-line algorithms for weighted bipartite matching and stable marriages, 728-738 [Zbl 0768.68154] \textit{Naor, Moni}, String matching with preprocessing of text and pattern, 739-750 [Zbl 0769.68107] \textit{Ravi, R.; Agrawal, Ajit; Klein, Philip}, Ordering problems approximated: Single-processor scheduling and interval graph completion, 751-762 [Zbl 0772.68043]