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