Ésik, Zoltán (ed.) Fundamentals of computation theory. 9th international conference, FCT ’93, Szeged, Hungary, August 23–27, 1993. Proceedings. (English) Zbl 0875.00104 Lecture Notes in Computer Science 710. Berlin: Springer-Verlag. IX, 471 p. DM 86.00 /sc (1993). Show indexed articles as search result. The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 0875.00097].Indexed articles:Diekert, Volker, Rewriting, Möbius functions and semi-commutations, 1-15 [Zbl 0794.68078]Dietzfelbinger, Martin, Simulations between different models of parallel computers, 16-30 [Zbl 0794.68054]Ito, Masami, Dense and disjunctive properties of languages, 31-49 [Zbl 0794.68091]Jürgensen, H.; Konstantinidis, S., The hierarchy of codes, 50-68 [Zbl 0790.94008]Kreowski, Hans-Jörg, Five facets of hyperedge replacement beyond context-freeness, 69-86 [Zbl 0794.68092]Milner, Robin, An action structure for synchronous \(\pi\)-calculus, 87-105 [Zbl 0794.68055]Pudlák, P., \(AC^ 0\) circuit complexity. (A survey of lower bounds), 106-120 [Zbl 0790.94029]Salomaa, Arto, Pattern languages: Problems of decidability and generation, 121-132 [Zbl 0794.68089]Abdulrab, Habib; Maksimenko, Marianne, General solution of mirror equation, 133-141 [Zbl 0829.20079]Andre, Yves; Bossut, Francis, Decidability of equivalence for linear letter to letter top-down tree transducers, 142-151 [Zbl 0794.68105]Bergstra, J. A.; Ştefănescu, Gh., Translations between flowchart schemes and process graphs, 152-161 [Zbl 0794.68053]Căzănescu, Virgil Emil, Local equational logic, 162-170 [Zbl 0802.03029]Chrząstowski-Wachtel, Piotr; Raczunas, Marek, Liveness of weighted circuits and the diophantine problem of Frobenius, 171-180 [Zbl 0794.68113]Courcelle, Bruno, Context-free graph grammars: Separating vertex replacement from hyperedge repelacement, 181-193 [Zbl 0793.68115]Dömösi, P.; Horváth, S.; Ito, M.; Kászonyi, L.; Katsura, M., Formal languages consisting of primitive words, 194-203 [Zbl 0794.68090]Durand, Bruno, Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof, 204-211 [Zbl 0794.68109]Ebert, Jürgen, Efficient interpretation of state charts, 212-221 [Zbl 0794.68118]Faßbender, Heinz, Implementation of a universal unification algorithm for macro tree transducers, 222-233 [Zbl 0794.68079]Fischer, Paul, Finding maximum convex polygons, 234-243 [Zbl 0794.68161]Fischer, Paul; Höffgen, Klaus-U.; Lefmann, Hanno; Łuczak, Tomasz, Approximations with axis-aligned rectangles, 244-255 [Zbl 0794.68159]Girkar, Mahesh; Moll, Robert, Vector sequence analysis and full weak safety for concurrent systems, 256-265 [Zbl 0797.68060]Gröger, Hans Dietmar, Does transitivity help? On the complexity of poset properties, 266-278 [Zbl 0825.68421]Hagerup, Torben; Maas, Martin, Generalized topological sorting in linear time, 279-288 [Zbl 0794.68026]Hemachandra, Lane A.; Silvestri, Riccardo, Easily checked self-reducibility, 289-298 [Zbl 0797.68065]Holzer, Markus; Lange, Klaus-Jörn, On the complexities of linear LL(1) and LR(1) grammars, 299-308 [Zbl 0794.68085]Dang Van Hung; Tran Van Dung, On the relation between firing sequences and processes of Petri nets, 309-318 [Zbl 0794.68112]Jansen, Klaus; Scheffler, Petra; Woeginger, Gerhard J., Maximum covering with \(D\) cliques, 319-328 [Zbl 0794.68117]Kemp, Rainer, Monotonically labelled ordered trees and multidimensional binary trees, 329-341 [Zbl 0791.05021]Kuske, Sabine, A maximum path length pumping lemma for edge-replacement languages, 342-351 [Zbl 0794.68116]Meier, Robert S.; Schott, René, Regular approximations to shuffle products of context-free languages, and convergence of their generating functions, 352-362 [Zbl 0794.68086]Manes, Ernest G., The equational theory of a Boolean monad, 363-374 [Zbl 0791.18009]Margenstern, Maurice, Non erasing Turing machines: A frontier between a decidable halting problem and universality, 375-385 [Zbl 0794.68047]Mateescu, Alexandru, On scattered syntactic monoids, 386-395 [Zbl 0794.68081]Potthoff, Andreas; Thomas, Wolfgang, Regular tree languages without unary symbols are star-free, 396-405 [Zbl 0794.68088]Róka, Zsuzsanna, One-way cellular automata on Cayley graphs, 406-417 [Zbl 0794.68106]Ružička, P.; Prívara, I., On tree pattern unification problems, 418-429 [Zbl 0802.68071]Salomaa, Kai; Wood, Derick; Yu, Sheng, Structural equivalence and ET0L grammars, 430-439 [Zbl 0794.68093]Slutzki, Giora; Vágvölgyi, Sándor, A hierarchy of deterministic top-down tree transformations, 440-451 [Zbl 0794.68080]Wu, Hongzhong, Synthesis of \(O(\lg n)\) testable trees, 452-461 [Zbl 0794.68075]Yin, Jilei; Hong, Zhu, On the learnability of a restricted predicate formulae, 462-471 [Zbl 0794.68129] Cited in 3 Reviews MSC: 00B25 Proceedings of conferences of miscellaneous specific interest 68-06 Proceedings, conferences, collections, etc. pertaining to computer science 68Qxx Theory of computing Keywords:Szeged (Hungary); Conference; Proceedings; FCT ’93; Computation theory Citations:Zbl 0875.00097 PDFBibTeX XMLCite \textit{Z. Ésik} (ed.), Fundamentals of computation theory. 9th international conference, FCT '93, Szeged, Hungary, August 23--27, 1993. Proceedings. Berlin: Springer-Verlag (1993; Zbl 0875.00104) Full Text: DOI