default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st FCT 1977: Poznan-Kórnik, Poland
- Marek Karpinski:
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
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, Stanislaw 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 - Heinz 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
- Jirí Adámek, Václav Koubek:
Remarks on Fixed Points of Functors. 199-205 - Jirí Adámek, Vera Trnková:
Recognizable and Regular Languages in a Category. 206-211 - Michael A. Arbib:
Free Dynamic and Algebraic Semantics. 212-227 - Michael A. Arbib, Ernest G. Manes:
Efficient State-Splitting. 228-239 - Gisbert Dittrich, Wolfgang Merzenich:
Nets over Many Sorted Operator Domains and Their Semantics. 240-244 - Hartmut Ehrig:
Embedding Theorem in the Algebraic Theory of Graph Grammars. 245-255 - Calvin C. Elgot:
Some "Geometrical" Categories Associated with Flowchart Schemes. 256-259 - Hans-Jürgen Hoehnke:
On Partial Recursive Definitions and Programs. 260-274 - Hans-Jörg Kreowski:
Transformationas of Derivation Sequences in Graph Grammars. 275-286 - Petr Kurka:
Applicability of a Production in a Categorical Grammar. 287-293 - José Meseguer:
On Order-Complete Universal Algebra and Enriched Functorial Semantics. 294-301 - Adam Obtulowicz:
Functorial Semantics of the Type Free lambda-beta eta Calculus. 302-307 - Jan Reiterman:
A More Categorical Model of Universal Algebra. 308-313 - Hans Jürgen Schneider:
Graph Grammars. 314-331 - Jerzy Tiuryn:
Fixed-Points and Algebras with Infinitely Long Expressions, II. 332-339 - Vera Trnková:
Relational Automata ina Category and their Language. 340-355 - A. Wiweger:
Generalized Linton Algebras. 356-358
Computability, Decidability & Arithmetic Complexity
- Edward G. Belaga:
On Analysis of Protoschemes. 361-366 - J. Richard Büchi:
Using Determinancy of Games to Eliminate Quantifiers. 367-378 - Douglas A. Cenzer:
Non-Generable RE Sets. 379-385 - Michael A. Frumkin:
Polynomial Time Algorithms in the Theory of Linear Diophantine Equations. 386-392 - Daniel S. Hirschberg:
Complexity of Common Subsequence Problems. 393-398 - Sándor Horváth:
Complexity of Sequence Encoding. 399-404 - Günter Hotz, Manfred Stadl:
Network Complexity. 405-420 - Max I. Kanovic:
On Computability of Kolmogorov Complexity. 421-422 - Marek Karpinski:
The Equivalences Problems for Binary EOL-Systems are Decidable. 423-434 - Efim B. Kinber:
On a Theory of Inductive Inference. 435-440 - Antoni Kreczmar:
On Finite and Infinite Computations. 441-446 - Ludek Kucera:
Expected Behavior of Graph Coloring Algorithms. 447-451 - Witold Lipski Jr.:
Two NP-Complete Problems Related to Information Retrieval. 452-458 - Tomasz Müldner:
On Properties of Certain Synchronizing Tool for Parallel Computations. 459-465 - J. Ian Munro:
The Parallel Complexity of Arithmetic Computation. 466-475 - Eugene M. Morris:
Maximal Rectangular Relations. 476-481 - Jaroslav Nesetril, Ales Pultr:
A Dushnik - Miller Type Dimension of Graphs and its Complexity. 482-493 - S. Radziszowski:
Programming and P=NP Conjecture. 494-498 - Andrzej Salwicki:
An Algorithmic Approach to Set Theory. 499-510 - Detlef Seese:
Decidability of omaega-Trees with Bounded Sets - A Survey. 511-515 - Ludwig Staiger:
Empty - Storage - Acceptance of omega-Languages. 516-521 - Dirk Siefkes:
Degrees of Circuit Complexity. 522-531 - Klaus W. Wagner, Ludwig Staiger:
Recursive omega-Languages. 532-537 - Klaus Weihrauch:
A Genralized Computability Thesis. 538-542
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 2025-04-28 20:48 CEST 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:
