1. FCT 1977:
Poznan-Kórnik,
Poland
Marek Karpinski (Ed.):
Fundamentals of Computation Theory, Proceedings of the 1977 International FCT-Conference, Poznan-Kórnik, Poland, September 19-23, 1977.
Lecture Notes in Computer Science 56 Springer 1977, ISBN 3-540-08442-8 
@proceedings{DBLP:conf/fct/1977,
editor = {Marek Karpinski},
title = {Fundamentals of Computation Theory, Proceedings of the 1977 International
FCT-Conference, Poznan-K{\'o}rnik, Poland, September 19-23,
1977},
booktitle = {FCT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {56},
year = {1977},
isbn = {3-540-08442-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Algebraic & Constructive Theory of Machines,
Computations and Languages
- R. G. Bukharajev, Ju. A. Alpin:
Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability.
3-11
- André Arnold, Maurice Nivat:
Non Deterministic Recursive Program Schemes.
12-21
- Alexander R. Bednarek, S. M. Ulam:
Some Remarks on Relational Composition in Computational Theory and Practice.
22-32
- Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide:
An Axiomatization of the Rational Data Objects.
33-38
- Jean Berstel:
Some Recent Results on Recognizable Formal Power Series.
39-48
- Meera Blattner, Seymour Ginsburg:
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.
49-53
- Lothar Budach:
Environments, Labyrinths and Automata.
54-64
- Wolfgang Coy:
Automata in Labyrinths.
65-71
- Hans Daduna:
Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory.
72-77
- Jürgen Dassow:
Some Remarks on the Algebra of Automation Mapping.
78-83
- Hans-Dieter Ehrich:
Algebraic Semantics of Type Definitions and Structured Variables.
84-97
- Ferenc Gécseg:
Universal Algebras and Tree Automata.
98-112
- Ryszard Janicki:
Vectors of Coroutines over Blikle Nets.
113-119
- H. Kaphengst, Horst Reichel:
Initial Algebraic Semantics for Non Context-Free Languages.
120-126
- Robert Knast, Jacek Martinek:
Reading Functions and an Extension of Kleene Theorem for some Families of Languages.
127-134
- Andrzej Wlodzimierz Mostowski:
Operations on omega-Regular Languages.
135-141
- Manfred Nagl:
On the Relation Between Graph Grammars and Graph L-Systems.
142-151
- Jean-François Perrot:
On the Theory of Syntactic Monoids for Rational Languages.
152-165
- M. Roytberg:
The Equivalence of Schemata with some Feedback.
166-170
- Huei-Jan Shyr, Gabriel Thierrin:
Disjunctive Languages and Codes.
171-176
- Wolfgang Wechler:
Families of R-Fuzzy Languages.
177-186
- Józef Winkowski:
Algebras of Partial Sequences - A Tool to Deal with Concurrency.
187-198
Computation Theory in Category
Computability,
Decidability & Arithmetic Complexity
Last update Wed May 23 00:46:32 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
