FCT B

41 papers

YearTitle / Authors
1993A Hierarchy of Deterministic Top-down Tree Transformations.
Giora Slutzki, Sándor Vágvölgyi
1993A Maximum Path Length Pumping Lemma for Edge-Replacement Languages.
Sabine Kuske
1993AC
Pavel Pudlák
1993An Action Structure for Synchronous pi-Calculus.
Robin Milner
1993Approximations with Axis-Aligned Rectangles (Extended Abstract).
Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
1993Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement.
Bruno Courcelle
1993Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers.
Yves Andre, Francis Bossut
1993Dense and Disjunctive Properties of Languages.
Masami Ito
1993Does Transitivity Help? On the Complexity of Poset Properties.
Hans Dietmar Gröger
1993Easity Checked Self-Reducibility (Extended Abstract).
Lane A. Hemachandra, Riccardo Silvestri
1993Efficient Interpretation of State Charts.
Jürgen Ebert
1993Finding Maximum Convex Polygons.
Paul Fischer
1993Five Facets of Hyperedge Replacement Beyond Context-Freeness.
Hans-Jörg Kreowski
1993Formal Languages Consisting of Primitive Words.
Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura
1993Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings
Zoltán Ésik
1993General Solution of Mirror Equation.
Habib Abdulrab, Marianne Maksimenko
1993Generalized Topological Sorting in Linear Time.
Torben Hagerup, Martin Maas
1993Implementation of a Universal Unification Algorithm for Macro Tree Transducers.
Heinz Faßbender
1993Liveness of Weighted Circuits and the Diophantine Problem of Frobenius.
Piotr Chrzastowski-Wachtel, Marek Raczunas
1993Local Equational Logic.
Virgil Emil Cazanescu
1993Maximum Covering with D Cliques.
Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
1993Monotonically Labelled Ordered Trees and Multidimensional Binary Trees.
Rainer Kemp
1993Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality.
Maurice Margenstern
1993On Scattered Syntactic Monoids.
Alexandru Mateescu
1993On Tree Pattern Unification Problems.
Peter Ruzicka, Igor Prívara
1993On the Complexities of Linear LL(1) and LR(1) Grammars.
Markus Holzer, Klaus-Jörn Lange
1993On the Learnability of a Restricted Predicate Formulae.
Jilei Yin, Hong Zhu
1993On the Relation Between Firing Sequences and Processes of Petri Nets.
Dang Van Hung, Tran Van Dung
1993One-way Cellular Automata on Cayley Graphs.
Zsuzsanna Róka
1993Pattern Languages: Problems of Decidability and Generation.
Arto Salomaa
1993Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions.
Robert S. Maier, René Schott
1993Regular Tree Languages Without Unary Symbols are Star-Free.
Andreas Potthoff, Wolfgang Thomas
1993Rewriting, Möbius Functions and Semi-Commutations.
Volker Diekert
1993Simulations Between Different Models of Parallel Computers.
Martin Dietzfelbinger
1993Structural Equivalences and ET0L Grammars (Extended Abstract).
Kai Salomaa, Derick Wood, Sheng Yu
1993Synthesis of O(lg n) Testable Trees.
Hongzhong Wu
1993The Equational Theory of a Boolean Monad.
Ernest G. Manes
1993The Hierarchy of Codes.
Helmut Jürgensen, Stavros Konstantinidis
1993Translations Between Flowchart Schemes and Process Graphs.
Jan A. Bergstra, Gheorghe Stefanescu
1993Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.
Bruno Durand
1993Vector Sequence Analysis and Full Weak Safety for Concurrent Systems.
Mahesh Girkar, Robert Moll