Conferences in DBLP
Jirí Adámek Observability and Nerode Equivalence in Concrete C5ategories. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:1-15 [Conf ] Hajnal Andréka , István Németi Some Universal Algebraic and Model Theoretic Results in Computer Science. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:16-23 [Conf ] Giorgio Ausiello , Alberto Marchetti-Spaccamela , Marco Protasi Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:24-33 [Conf ] László Babai Moderately Exponential Bound for Graph Isomorphism. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:34-50 [Conf ] Miklós Bartha An Algebraic Defenition of Attributed Transformations. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:51-60 [Conf ] Franz-Josef Brandenburg Analogies of PAL and COPY. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:61-70 [Conf ] Peter Burmeister Quasi-Equational Logic for Partial Algebras. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:71-80 [Conf ] B. Csákány Homogenity and Completeness. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:81-89 [Conf ] Robert P. Daley On the Error Correcting Power of Pluralism in Inductive Inference. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:90-99 [Conf ] Jürgen Dassow Equality Languages and Language Families. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:100-109 [Conf ] János Demetrovics , Gyula O. H. Katona Extremal Combinatorial Problems in Relational Data Base. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:110-119 [Conf ] Hans-Dieter Ehrich Specifying Algebraic Data Types by Domain Equations. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:120-129 [Conf ] Zoltán Ésik An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:130-136 [Conf ] Pavel Goralcik , A. Goralciková , Václav Koubek , Vojtech Rödl Fast Recognition of Rings and Lattices. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:137-145 [Conf ] Hagen Huwig A Definition of the P=NP-Problem in Categories. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:146-153 [Conf ] Dirk Janssens , Grzegorz Rozenberg Generating Graph Languages Using Hypergraph Grammars. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:154-164 [Conf ] Jerzy W. Jaromczyk Lower Bounds for Problems Defined by Polynomial Inequalities. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:165-172 [Conf ] H. Kaphengst What is Computable for Abstract Data Types? [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:173-181 [Conf ] Juhani Karhumäki On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:182-189 [Conf ] H. C. M. Kleijn , Grzegorz Rozenberg On the Role of Selectors in Selective Substitution Grammars. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:190-198 [Conf ] Hans Kleine Büning Classes of Functions over Binary Trees. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:199-204 [Conf ] Bernhard Korte , László Lovász Mathematical Structures Underlying Greedy Algorithms. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:205-209 [Conf ] Juha Kortelainen Some Properties of Language Families Generated by Commutative Languages. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:210-217 [Conf ] Ludek Kucera , Vera Trnková Isomorphism Completeness for Some Algebraic Structures. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:218-225 [Conf ] Bernard Leguy Reducing Algebraic Tree Grammars. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:226-233 [Conf ] Jeannine Leguy Rational Cone and Substitution. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:234-243 [Conf ] Matti Linna On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:244-249 [Conf ] Wolfgang Merzenich Co-Algebras as Machines for the Interpretations of Flow Diagrams. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:250-258 [Conf ] Friedhelm Meyer auf der Heide , Hans-Anton Rollik Random Access Machines and Straight-Line Programs. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:259-264 [Conf ] Burkhard Monien On the LBA Problem. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:265-280 [Conf ] István Németi Dynamic Algebras of Programs. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:281-290 [Conf ] Anton Nijholt The Equivalence Problem for LL- and LR-Regular Grammars. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:291-300 [Conf ] Axel Poigné Context-Free Languages of Infinite Words As Least Fixpoints. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:301-310 [Conf ] Piotr W. Prószynski Remarks on the Notion of Concurrency Relation in the Case of Systems. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:311-320 [Conf ] Ales Pultr On the Size of Conjunctive Representations of n-ary Relations. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:321-327 [Conf ] Grzegorz Rozenberg On Subwords of Formal Languages. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:328-333 [Conf ] Ildikó Sain First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:334-340 [Conf ] Detlef Seese Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:341-349 [Conf ] Peter H. Starke Processes in Petri Nets. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:350-359 [Conf ] Magnus Steinby Some Algebraic Aspects of Recognizability and Rationality. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:360-372 [Conf ] Ivan Hal Sudborough Pebbling and Bandwith. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:373-383 [Conf ] György Turán On Cellular Graph-Automata and Second-Order Definable Graph-Properties. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:384-393 [Conf ] Jirí Vinárek Extensions of Symmetric Hom-Functors to the Kleisli Category. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:394-399 [Conf ] Joffroy Beauquier A New Operation Between Languages. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:400-409 [Conf ] Egon Börger Logical Description of Computation Processes. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:410-424 [Conf ] Jan Grabowski An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:425-432 [Conf ] Frank Hoffmann One Pebble Does Not Suffice to Search Plane Labyrinths. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:433-444 [Conf ] Christoph Meinel About the by Codings of Environments Induced Posets [a_{z} , <=] and [L_{z} , <=]. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:445-452 [Conf ] Andrzej Wlodzimierz Mostowski The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:453-466 [Conf ] Stephan Waack Tape Complexity of Word Problems. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:467-471 [Conf ]