FCT B

64 papers

YearTitle / Authors
1977A Dushnik - Miller Type Dimension of Graphs and its Complexity.
Jaroslav Nesetril, Ales Pultr
1977A Genralized Computability Thesis.
Klaus Weihrauch
1977A More Categorical Model of Universal Algebra.
Jan Reiterman
1977Algebraic Semantics of Type Definitions and Structured Variables.
Hans-Dieter Ehrich
1977Algebras of Partial Sequences - A Tool to Deal with Concurrency.
Józef Winkowski
1977An Algorithmic Approach to Set Theory.
Andrzej Salwicki
1977An Axiomatization of the Rational Data Objects.
Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide
1977Applicability of a Production in a Categorical Grammar.
Petr Kurka
1977Automata in Labyrinths.
Wolfgang Coy
1977Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.
Meera Blattner, Seymour Ginsburg
1977Complexity of Common Subsequence Problems.
Daniel S. Hirschberg
1977Complexity of Sequence Encoding.
Sándor Horváth
1977Decidability of omaega-Trees with Bounded Sets - A Survey.
Detlef Seese
1977Degrees of Circuit Complexity.
Dirk Siefkes
1977Disjunctive Languages and Codes.
Huei-Jan Shyr, Gabriel Thierrin
1977Efficient State-Splitting.
Michael A. Arbib, Ernest G. Manes
1977Embedding Theorem in the Algebraic Theory of Graph Grammars.
Hartmut Ehrig
1977Empty - Storage - Acceptance of omega-Languages.
Ludwig Staiger
1977Environments, Labyrinths and Automata.
Lothar Budach
1977Expected Behavior of Graph Coloring Algorithms.
Ludek Kucera
1977Families of R-Fuzzy Languages.
Wolfgang Wechler
1977Fixed-Points and Algebras with Infinitely Long Expressions, II.
Jerzy Tiuryn
1977Free Dynamic and Algebraic Semantics.
Michael A. Arbib
1977Functorial Semantics of the Type Free lambda-beta eta Calculus.
Adam Obtulowicz
1977Fundamentals of Computation Theory, Proceedings of the 1977 International FCT-Conference, Poznan-Kórnik, Poland, September 19-23, 1977
Marek Karpinski
1977Generalized Linton Algebras.
A. Wiweger
1977Graph Grammars.
Hans Jürgen Schneider
1977Initial Algebraic Semantics for Non Context-Free Languages.
Heinz Kaphengst, Horst Reichel
1977Maximal Rectangular Relations.
Eugene M. Morris
1977Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability.
R. G. Bukharajev, Ju. A. Alpin
1977Nets over Many Sorted Operator Domains and Their Semantics.
Gisbert Dittrich, Wolfgang Merzenich
1977Network Complexity.
Günter Hotz, Manfred Stadl
1977Non Deterministic Recursive Program Schemes.
André Arnold, Maurice Nivat
1977Non-Generable RE Sets.
Douglas A. Cenzer
1977On Analysis of Protoschemes.
Edward G. Belaga
1977On Computability of Kolmogorov Complexity.
Max I. Kanovic
1977On Finite and Infinite Computations.
Antoni Kreczmar
1977On Order-Complete Universal Algebra and Enriched Functorial Semantics.
José Meseguer
1977On Partial Recursive Definitions and Programs.
Hans-Jürgen Hoehnke
1977On Properties of Certain Synchronizing Tool for Parallel Computations.
Tomasz Müldner
1977On a Theory of Inductive Inference.
Efim B. Kinber
1977On the Relation Between Graph Grammars and Graph L-Systems.
Manfred Nagl
1977On the Theory of Syntactic Monoids for Rational Languages.
Jean-François Perrot
1977Operations on omega-Regular Languages.
Andrzej Wlodzimierz Mostowski
1977Polynomial Time Algorithms in the Theory of Linear Diophantine Equations.
Michael A. Frumkin
1977Programming and P=NP Conjecture.
S. Radziszowski
1977Reading Functions and an Extension of Kleene Theorem for some Families of Languages.
Robert Knast, Jacek Martinek
1977Recognizable and Regular Languages in a Category.
Jirí Adámek, Vera Trnková
1977Recursive omega-Languages.
Klaus W. Wagner, Ludwig Staiger
1977Relational Automata ina Category and their Language.
Vera Trnková
1977Remarks on Fixed Points of Functors.
Jirí Adámek, Václav Koubek
1977Some "Geometrical" Categories Associated with Flowchart Schemes.
Calvin C. Elgot
1977Some Recent Results on Recognizable Formal Power Series.
Jean Berstel
1977Some Remarks on Relational Composition in Computational Theory and Practice.
Alexander R. Bednarek, Stanislaw M. Ulam
1977Some Remarks on the Algebra of Automation Mapping.
Jürgen Dassow
1977Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory.
Hans Daduna
1977The Equivalence of Schemata with some Feedback.
M. Roytberg
1977The Equivalences Problems for Binary EOL-Systems are Decidable.
Marek Karpinski
1977The Parallel Complexity of Arithmetic Computation.
J. Ian Munro
1977Transformationas of Derivation Sequences in Graph Grammars.
Hans-Jörg Kreowski
1977Two NP-Complete Problems Related to Information Retrieval.
Witold Lipski Jr.
1977Universal Algebras and Tree Automata.
Ferenc Gécseg
1977Using Determinancy of Games to Eliminate Quantifiers.
J. Richard Büchi
1977Vectors of Coroutines over Blikle Nets.
Ryszard Janicki