default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd FCT 1981: Szeged, Hungary
- Ferenc Gécseg:
Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981. Lecture Notes in Computer Science 117, Springer 1981, ISBN 3-540-10854-8 - Jirí Adámek:
Observability and Nerode Equivalence in Concrete C5ategories. 1-15 - Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science. 16-23 - Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. 24-33 - László Babai
:
Moderately Exponential Bound for Graph Isomorphism. 34-50 - Miklós Bartha:
An Algebraic Defenition of Attributed Transformations. 51-60 - Franz-Josef Brandenburg:
Analogies of PAL and COPY. 61-70 - Peter Burmeister:
Quasi-Equational Logic for Partial Algebras. 71-80 - B. Csákány:
Homogenity and Completeness. 81-89 - Robert P. Daley:
On the Error Correcting Power of Pluralism in Inductive Inference. 90-99 - Jürgen Dassow:
Equality Languages and Language Families. 100-109 - János Demetrovics, Gyula O. H. Katona:
Extremal Combinatorial Problems in Relational Data Base. 110-119 - Hans-Dieter Ehrich:
Specifying Algebraic Data Types by Domain Equations. 120-129 - Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. 130-136 - Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices. 137-145 - Hagen Huwig:
A Definition of the P=NP-Problem in Categories. 146-153 - Dirk Janssens, Grzegorz Rozenberg:
Generating Graph Languages Using Hypergraph Grammars. 154-164 - Jerzy W. Jaromczyk:
Lower Bounds for Problems Defined by Polynomial Inequalities. 165-172 - Heinz Kaphengst:
What is Computable for Abstract Data Types? 173-181 - Juhani Karhumäki:
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. 182-189 - H. C. M. Kleijn, Grzegorz Rozenberg:
On the Role of Selectors in Selective Substitution Grammars. 190-198 - Hans Kleine Büning:
Classes of Functions over Binary Trees. 199-204 - Bernhard Korte, László Lovász:
Mathematical Structures Underlying Greedy Algorithms. 205-209 - Juha Kortelainen:
Some Properties of Language Families Generated by Commutative Languages. 210-217 - Ludek Kucera, Vera Trnková:
Isomorphism Completeness for Some Algebraic Structures. 218-225 - Bernard Leguy:
Reducing Algebraic Tree Grammars. 226-233 - Jeannine Leguy:
Rational Cone and Substitution. 234-243 - Matti Linna:
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. 244-249 - Wolfgang Merzenich:
Co-Algebras as Machines for the Interpretations of Flow Diagrams. 250-258 - Friedhelm Meyer auf der Heide, Hans-Anton Rollik:
Random Access Machines and Straight-Line Programs. 259-264 - Burkhard Monien:
On the LBA Problem. 265-280 - István Németi:
Dynamic Algebras of Programs. 281-290 - Anton Nijholt:
The Equivalence Problem for LL- and LR-Regular Grammars. 291-300 - Axel Poigné:
Context-Free Languages of Infinite Words As Least Fixpoints. 301-310 - Piotr W. Prószynski:
Remarks on the Notion of Concurrency Relation in the Case of Systems. 311-320 - Ales Pultr:
On the Size of Conjunctive Representations of n-ary Relations. 321-327 - Grzegorz Rozenberg:
On Subwords of Formal Languages. 328-333 - Ildikó Sain:
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. 334-340 - Detlef Seese:
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. 341-349 - Peter H. Starke:
Processes in Petri Nets. 350-359 - Magnus Steinby:
Some Algebraic Aspects of Recognizability and Rationality. 360-372 - Ivan Hal Sudborough:
Pebbling and Bandwith. 373-383 - György Turán:
On Cellular Graph-Automata and Second-Order Definable Graph-Properties. 384-393 - Jirí Vinárek:
Extensions of Symmetric Hom-Functors to the Kleisli Category. 394-399
Appendix
- Joffroy Beauquier:
A New Operation Between Languages. 400-409 - Egon Börger:
Logical Description of Computation Processes. 410-424 - Jan Grabowski:
An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. 425-432 - Frank Hoffmann:
One Pebble Does Not Suffice to Search Plane Labyrinths. 433-444 - Christoph Meinel:
About the by Codings of Environments Induced Posets [az, <=] and [Lz, <=]. 445-452 - Andrzej Wlodzimierz Mostowski:
The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. 453-466 - Stephan Waack:
Tape Complexity of Word Problems. 467-471
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
