3. FCT 1981:
Szeged,
Hungary
Ferenc Gécseg (Ed.):
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 BibTeX
@proceedings{DBLP:conf/fct/1981,
editor = {Ferenc G{\'e}cseg},
title = {Fundamentals of Computation Theory, FCT'81, Proceedings of the
1981 International FCT-Conference, Szeged, Hungary, August 24-28,
1981},
booktitle = {FCT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {117},
year = {1981},
isbn = {3-540-10854-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Jirí Adámek:
Observability and Nerode Equivalence in Concrete C5ategories.
1-15 BibTeX
- Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science.
16-23 BibTeX
- Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.
24-33 BibTeX
- László Babai:
Moderately Exponential Bound for Graph Isomorphism.
34-50 BibTeX
- Miklós Bartha:
An Algebraic Defenition of Attributed Transformations.
51-60 BibTeX
- Franz-Josef Brandenburg:
Analogies of PAL and COPY.
61-70 BibTeX
- Peter Burmeister:
Quasi-Equational Logic for Partial Algebras.
71-80 BibTeX
- B. Csákány:
Homogenity and Completeness.
81-89 BibTeX
- Robert P. Daley:
On the Error Correcting Power of Pluralism in Inductive Inference.
90-99 BibTeX
- Jürgen Dassow:
Equality Languages and Language Families.
100-109 BibTeX
- János Demetrovics, Gyula O. H. Katona:
Extremal Combinatorial Problems in Relational Data Base.
110-119 BibTeX
- Hans-Dieter Ehrich:
Specifying Algebraic Data Types by Domain Equations.
120-129 BibTeX
- Zoltán Ésik:
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration.
130-136 BibTeX
- Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices.
137-145 BibTeX
- Hagen Huwig:
A Definition of the P=NP-Problem in Categories.
146-153 BibTeX
- Dirk Janssens, Grzegorz Rozenberg:
Generating Graph Languages Using Hypergraph Grammars.
154-164 BibTeX
- Jerzy W. Jaromczyk:
Lower Bounds for Problems Defined by Polynomial Inequalities.
165-172 BibTeX
- H. Kaphengst:
What is Computable for Abstract Data Types?
173-181 BibTeX
- Juhani Karhumäki:
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.
182-189 BibTeX
- H. C. M. Kleijn, Grzegorz Rozenberg:
On the Role of Selectors in Selective Substitution Grammars.
190-198 BibTeX
- Hans Kleine Büning:
Classes of Functions over Binary Trees.
199-204 BibTeX
- Bernhard Korte, László Lovász:
Mathematical Structures Underlying Greedy Algorithms.
205-209 BibTeX
- Juha Kortelainen:
Some Properties of Language Families Generated by Commutative Languages.
210-217 BibTeX
- Ludek Kucera, Vera Trnková:
Isomorphism Completeness for Some Algebraic Structures.
218-225 BibTeX
- Bernard Leguy:
Reducing Algebraic Tree Grammars.
226-233 BibTeX
- Jeannine Leguy:
Rational Cone and Substitution.
234-243 BibTeX
- Matti Linna:
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars.
244-249 BibTeX
- Wolfgang Merzenich:
Co-Algebras as Machines for the Interpretations of Flow Diagrams.
250-258 BibTeX
- Friedhelm Meyer auf der Heide, Hans-Anton Rollik:
Random Access Machines and Straight-Line Programs.
259-264 BibTeX
- Burkhard Monien:
On the LBA Problem.
265-280 BibTeX
- István Németi:
Dynamic Algebras of Programs.
281-290 BibTeX
- Anton Nijholt:
The Equivalence Problem for LL- and LR-Regular Grammars.
291-300 BibTeX
- Axel Poigné:
Context-Free Languages of Infinite Words As Least Fixpoints.
301-310 BibTeX
- Piotr W. Prószynski:
Remarks on the Notion of Concurrency Relation in the Case of Systems.
311-320 BibTeX
- Ales Pultr:
On the Size of Conjunctive Representations of n-ary Relations.
321-327 BibTeX
- Grzegorz Rozenberg:
On Subwords of Formal Languages.
328-333 BibTeX
- Ildikó Sain:
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.
334-340 BibTeX
- Detlef Seese:
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.
341-349 BibTeX
- Peter H. Starke:
Processes in Petri Nets.
350-359 BibTeX
- Magnus Steinby:
Some Algebraic Aspects of Recognizability and Rationality.
360-372 BibTeX
- Ivan Hal Sudborough:
Pebbling and Bandwith.
373-383 BibTeX
- György Turán:
On Cellular Graph-Automata and Second-Order Definable Graph-Properties.
384-393 BibTeX
- Jirí Vinárek:
Extensions of Symmetric Hom-Functors to the Kleisli Category.
394-399 BibTeX
Appendix
Copyright © Sat May 16 23:11:57 2009
by Michael Ley (ley@uni-trier.de)
