The SCEAS System
Navigation Menu

Conferences in DBLP

Fundamentals of Computation Theory (FCT) (fct)
1977 (conf/fct/77)

  1. R. G. Bukharajev, Ju. A. Alpin
    Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:3-11 [Conf]
  2. André Arnold, Maurice Nivat
    Non Deterministic Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:12-21 [Conf]
  3. Alexander R. Bednarek, S. M. Ulam
    Some Remarks on Relational Composition in Computational Theory and Practice. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:22-32 [Conf]
  4. Jan A. Bergstra, Alexander Ollongren, Theo P. van der Weide
    An Axiomatization of the Rational Data Objects. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:33-38 [Conf]
  5. Jean Berstel
    Some Recent Results on Recognizable Formal Power Series. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:39-48 [Conf]
  6. Meera Blattner, Seymour Ginsburg
    Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:49-53 [Conf]
  7. Lothar Budach
    Environments, Labyrinths and Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:54-64 [Conf]
  8. Wolfgang Coy
    Automata in Labyrinths. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:65-71 [Conf]
  9. Hans Daduna
    Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:72-77 [Conf]
  10. Jürgen Dassow
    Some Remarks on the Algebra of Automation Mapping. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:78-83 [Conf]
  11. Hans-Dieter Ehrich
    Algebraic Semantics of Type Definitions and Structured Variables. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:84-97 [Conf]
  12. Ferenc Gécseg
    Universal Algebras and Tree Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:98-112 [Conf]
  13. Ryszard Janicki
    Vectors of Coroutines over Blikle Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:113-119 [Conf]
  14. H. Kaphengst, Horst Reichel
    Initial Algebraic Semantics for Non Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:120-126 [Conf]
  15. Robert Knast, Jacek Martinek
    Reading Functions and an Extension of Kleene Theorem for some Families of Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:127-134 [Conf]
  16. Andrzej Wlodzimierz Mostowski
    Operations on omega-Regular Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:135-141 [Conf]
  17. Manfred Nagl
    On the Relation Between Graph Grammars and Graph L-Systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:142-151 [Conf]
  18. Jean-François Perrot
    On the Theory of Syntactic Monoids for Rational Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:152-165 [Conf]
  19. M. Roytberg
    The Equivalence of Schemata with some Feedback. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:166-170 [Conf]
  20. Huei-Jan Shyr, Gabriel Thierrin
    Disjunctive Languages and Codes. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:171-176 [Conf]
  21. Wolfgang Wechler
    Families of R-Fuzzy Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:177-186 [Conf]
  22. Józef Winkowski
    Algebras of Partial Sequences - A Tool to Deal with Concurrency. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:187-198 [Conf]
  23. Jirí Adámek, Václav Koubek
    Remarks on Fixed Points of Functors. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:199-205 [Conf]
  24. Jirí Adámek, Vera Trnková
    Recognizable and Regular Languages in a Category. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:206-211 [Conf]
  25. Michael A. Arbib
    Free Dynamic and Algebraic Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:212-227 [Conf]
  26. Michael A. Arbib, Ernest G. Manes
    Efficient State-Splitting. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:228-239 [Conf]
  27. Gisbert Dittrich, Wolfgang Merzenich
    Nets over Many Sorted Operator Domains and Their Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:240-244 [Conf]
  28. Hartmut Ehrig
    Embedding Theorem in the Algebraic Theory of Graph Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:245-255 [Conf]
  29. Calvin C. Elgot
    Some ``Geometrical'' Categories Associated with Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:256-259 [Conf]
  30. Hans-Jürgen Hoehnke
    On Partial Recursive Definitions and Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:260-274 [Conf]
  31. Hans-Jörg Kreowski
    Transformationas of Derivation Sequences in Graph Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:275-286 [Conf]
  32. Petr Kurka
    Applicability of a Production in a Categorical Grammar. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:287-293 [Conf]
  33. José Meseguer
    On Order-Complete Universal Algebra and Enriched Functorial Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:294-301 [Conf]
  34. Adam Obtulowicz
    Functorial Semantics of the Type Free lambda-beta eta Calculus. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:302-307 [Conf]
  35. Jan Reiterman
    A More Categorical Model of Universal Algebra. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:308-313 [Conf]
  36. Hans Jürgen Schneider
    Graph Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:314-331 [Conf]
  37. Jerzy Tiuryn
    Fixed-Points and Algebras with Infinitely Long Expressions, II. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:332-339 [Conf]
  38. Vera Trnková
    Relational Automata ina Category and their Language. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:340-355 [Conf]
  39. A. Wiweger
    Generalized Linton Algebras. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:356-358 [Conf]
  40. Edward G. Belaga
    On Analysis of Protoschemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:361-366 [Conf]
  41. J. Richard Büchi
    Using Determinancy of Games to Eliminate Quantifiers. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:367-378 [Conf]
  42. Douglas A. Cenzer
    Non-Generable RE Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:379-385 [Conf]
  43. Michael A. Frumkin
    Polynomial Time Algorithms in the Theory of Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:386-392 [Conf]
  44. Daniel S. Hirschberg
    Complexity of Common Subsequence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:393-398 [Conf]
  45. Sándor Horváth
    Complexity of Sequence Encoding. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:399-404 [Conf]
  46. Günter Hotz, Manfred Stadl
    Network Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:405-420 [Conf]
  47. Max I. Kanovic
    On Computability of Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:421-422 [Conf]
  48. Marek Karpinski
    The Equivalences Problems for Binary EOL-Systems are Decidable. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:423-434 [Conf]
  49. Efim B. Kinber
    On a Theory of Inductive Inference. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:435-440 [Conf]
  50. Antoni Kreczmar
    On Finite and Infinite Computations. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:441-446 [Conf]
  51. Ludek Kucera
    Expected Behavior of Graph Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:447-451 [Conf]
  52. Witold Lipski Jr.
    Two NP-Complete Problems Related to Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:452-458 [Conf]
  53. Tomasz Müldner
    On Properties of Certain Synchronizing Tool for Parallel Computations. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:459-465 [Conf]
  54. J. Ian Munro
    The Parallel Complexity of Arithmetic Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:466-475 [Conf]
  55. Eugene M. Morris
    Maximal Rectangular Relations. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:476-481 [Conf]
  56. Jaroslav Nesetril, Ales Pultr
    A Dushnik - Miller Type Dimension of Graphs and its Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:482-493 [Conf]
  57. S. Radziszowski
    Programming and P=NP Conjecture. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:494-498 [Conf]
  58. Andrzej Salwicki
    An Algorithmic Approach to Set Theory. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:499-510 [Conf]
  59. Detlef Seese
    Decidability of omaega-Trees with Bounded Sets - A Survey. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:511-515 [Conf]
  60. Ludwig Staiger
    Empty - Storage - Acceptance of omega-Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:516-521 [Conf]
  61. Dirk Siefkes
    Degrees of Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:522-531 [Conf]
  62. Klaus W. Wagner, Ludwig Staiger
    Recursive omega-Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:532-537 [Conf]
  63. Klaus Weihrauch
    A Genralized Computability Thesis. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:538-542 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002