The SCEAS System
Navigation Menu

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
1976 (conf/mfcs/1976)

  1. Krzysztof R. Apt, J. W. de Bakker
    Exercises in Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:1-11 [Conf]
  2. Wilfried Brauer
    W-Automata and Their Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:12-22 [Conf]
  3. Jean-Marc Cadiou
    On Semantic Issues in the Relational Model of Data. [Citation Graph (17, 0)][DBLP]
    MFCS, 1976, pp:23-38 [Conf]
  4. Edsger W. Dijkstra
    The Effective Arrangement of Logical Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:39-51 [Conf]
  5. Giorgio Germano, Andrea Maggiolo-Schettini
    Recursivity, Sequence Recursivity, Stack Recursivity and Semantics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:52-64 [Conf]
  6. Jozef Gruska
    Descriptional Complexity (of Languages) - A Short Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:65-80 [Conf]
  7. Ivan M. Havel
    On the Branching Structure of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:81-98 [Conf]
  8. N. M. Nagorny
    Algorithms and Real Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:99-104 [Conf]
  9. Miroslav Novotný
    On Mappings of Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:105-114 [Conf]
  10. Arto Salomaa
    Recent Results on L Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:115-123 [Conf]
  11. Peter H. Starke
    Decision Problems for Multi-Tape Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:124-136 [Conf]
  12. Boris A. Trakhtenbrot
    Recursive Program Schemas and Computable Functionals. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:137-152 [Conf]
  13. Eric G. Wagner, Jesse B. Wright, Joseph A. Goguen, James W. Thatcher
    Some Fundamentals of Order-Algebraic Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:153-168 [Conf]
  14. Valery N. Agafonov
    On Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:169-172 [Conf]
  15. Luigia Carlucci Aiello, Mario Aiello, Giuseppe Attardi, P. Cavallari, Gianfranco Prini
    Formal Definition of Semantics of Generated Control Regimes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:173-179 [Conf]
  16. E. S. Bainbridge
    Minimal While Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:180-186 [Conf]
  17. Václav Benda, Kamila Bendová
    On Specfic Features of Recognizable Families of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:187-193 [Conf]
  18. Eberhard Bergmann
    On the Termination of Simple Computer Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:194-201 [Conf]
  19. Gérard Berthelot, Gérard Roucairol
    Reduction of Petri-Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:202-209 [Conf]
  20. Jürgen Brunner, Wolfgang Wechler
    On Behaviour of R-Fuzzy Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:210-215 [Conf]
  21. A. O. Buda
    Cannonizing Reducibility Method in the Theory of Program Schemata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:216-223 [Conf]
  22. Christian Choffrut
    Strongly Connected G-S-M Mappings Preserving Conjugation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:224-229 [Conf]
  23. Michal Chytil
    Analysis of the Non-Context-Free Component of Formal Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:230-236 [Conf]
  24. Marco Colombetti, Enrico Pagello
    Programs, Computations and Temporal Features. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:237-243 [Conf]
  25. Wolfgang Coy
    A Note on the Automatic Generation of Inductive Assertions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:244-249 [Conf]
  26. Armin B. Cremers, Thomas N. Hibbard
    On the Relationship between a Procedure and its Data. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:250-254 [Conf]
  27. Michael I. Dekhtyar
    On the Relativization of Deterministic and Nondeterministic Complexity Classes. [Citation Graph (1, 0)][DBLP]
    MFCS, 1976, pp:255-259 [Conf]
  28. Alexandru Dinca
    The Metric Properties on the Semigroups and the Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:260-264 [Conf]
  29. David P. Dobkin, Richard J. Lipton
    A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:265-269 [Conf]
  30. Willibald Dörfler
    The Direct Product of Automata and Quasi-Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:270-276 [Conf]
  31. Hans-Dieter Ehrich
    An Axiomatic Approach to Information Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:277-283 [Conf]
  32. Hartmut Ehrig, Hans-Jörg Kreowski
    Parallelism of Manipulations in Multidimensional Information Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:284-293 [Conf]
  33. Seymour Ginsburg, Otto Mayer
    On Strict Interpretations of Grammar Forms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:294-298 [Conf]
  34. Irina Gorun
    A Hierarchy of Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:299-303 [Conf]
  35. Janusz Górski
    On Consecutive Storage of Records. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:304-310 [Conf]
  36. Michal Grabowski
    A Remark on Equivalence of Mazurkiewicz's Finite-Control Algorithms over Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:311-316 [Conf]
  37. I. Hansen, Jacek Leszczylowski
    Microprogram-Oriented Model of the Controlled Structure. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:317-322 [Conf]
  38. M. D. Harrison
    Relations between Programs with Different Storage Requirements. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:323-329 [Conf]
  39. Friedrich W. von Henke
    An Algebraic Approach to Data Types, Program Verification, and Program Synthesis. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:330-336 [Conf]
  40. Matthias Höpner, Manfred Opp
    About Three Equations Classes of Languages Built Up By Shuffle Operations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:337-344 [Conf]
  41. Hagen Huwig
    A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:345-351 [Conf]
  42. Klaus Indermark
    Schemes with Recursion on Higher Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:352-358 [Conf]
  43. Jacek Irlik
    Constructing Iterative Version of a System of Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:359-363 [Conf]
  44. Walter Issel
    A Method Using a Set-Theoretical Formalism to Describe the Semantics of Programming Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:364-371 [Conf]
  45. Romuald Jagielski
    The Cubic Search Method. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:372-376 [Conf]
  46. Ryszard Janicki
    Vectors of Coroutines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:377-384 [Conf]
  47. Joanna Jedrzejowicz
    One-One Degrees of Turing Machines Decision Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:385-389 [Conf]
  48. Jozef Kelemen
    Heuristic Representation of State-Space by Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:390-394 [Conf]
  49. Robert Knast
    Semigroup Characterizations of Some Language Varieties. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:395-403 [Conf]
  50. Antoni Kreczmar
    On Memory Requirements of Strassen's Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:404-407 [Conf]
  51. Wlodzimierz Kwasowiec
    Determinism in Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:408-415 [Conf]
  52. Kurt Lautenbach, Horst Wedde
    Generating Control Mechanisms by Restrictions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:416-422 [Conf]
  53. Janusz W. Laski
    On Diagnosis of Algorithmical Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:423-429 [Conf]
  54. Boleslaw Mikolajczak
    On Some Properties of Cyclic Automata and Their Extensions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:430-435 [Conf]
  55. Peter D. Mosses
    Compiler Generation Using Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:436-441 [Conf]
  56. V. A. Nepomniaschy
    On Divergence Problems for Program Schemas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:442-445 [Conf]
  57. Anton Nijholt
    On the Parsing of LL-Regular Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:446-452 [Conf]
  58. Dominique Perrin
    The Characteristic Polynomial of a Finite Automaton. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:453-457 [Conf]
  59. P. Prusinkiewicz
    Error Detection Using Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:458-464 [Conf]
  60. Zbigniew W. Ras
    On a Relationship Between Programs of Address Machines and Mazurkiewicz Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:465-471 [Conf]
  61. Willem P. de Roever
    Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:472-481 [Conf]
  62. Grzegorz Rozenberg, Dirk Vermeir
    Context-Free Programmed Grammars and ETOL Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:482-487 [Conf]
  63. Teodor Rus
    Context-Free Algebra: A Mathematical Device for Compiler Specifications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:488-494 [Conf]
  64. Peter Ruzicka, Juraj Wiedermann
    On the Lower Bound for Minimum Comparison Selection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:495-502 [Conf]
  65. Andrzej Salwicki, Tomasz Müldner
    Computational Processes Generated by Programs with Recursive Procedures and Block Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:503-509 [Conf]
  66. Jacques Sakarovitch
    An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:510-516 [Conf]
  67. Vladimir Yu. Sazonov
    Degrees of Parallelism in Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:517-523 [Conf]
  68. A. Schurmann
    On Adaptability of a System of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:524-529 [Conf]
  69. Andrzej Skowron
    A Mathematical Model of Parallel Information Processing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:530-536 [Conf]
  70. Michael B. Smyth
    Powerdomains. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:537-543 [Conf]
  71. Jerzy Tiuryn
    On the Domain of Iteration in Iterative Algebraic Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:544-550 [Conf]
  72. Rutger Verbeek, Klaus Weihrauch
    The Influence of the Data Presentation on the Computational POwer of Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:551-558 [Conf]
  73. Józef Winkowski
    On Sequential Modelling of Non-Sequential Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:559-568 [Conf]
  74. Zbigniew Zwinogrodzki
    Equivalence and Optimization of Recursive Program Schemata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:569-575 [Conf]
  75. V. Giarratana, F. Gimona, Ugo Montanari
    Observability Concepts in Abstract Data Type Specifications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:576-587 [Conf]
  76. Hartmann J. Genrich, Gerda Thieler-Mevissen
    The Calculus of Facts. [Citation Graph (1, 0)][DBLP]
    MFCS, 1976, pp:588-595 [Conf]
  77. Marek Karpinski
    Multiplicity Functions on Omega-Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:596-601 [Conf]
  78. Grazyna Mirkowska, Andrzej Salwicki
    A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with Procedures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:602-606 [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