The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jirí Becvár
    Sequential Functions and Generalized Moore and Mealy Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:1-8 [Conf]
  2. Alberto Bertoni
    Mathematical Methods of the Theory of Stochastic Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:9-22 [Conf]
  3. L. Beyga
    On the Quasi-Controllability of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:23-25 [Conf]
  4. Janusz A. Brzozowski, Michael Yoeli
    Models for Analysis of Races in Sequential Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:26-32 [Conf]
  5. Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright
    Factorizations, Congruences, and the Decomposition of Automata and Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:33-45 [Conf]
  6. Jerzy W. Grzymala-Busse
    On the Periodic Sum and Extensions of Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:46-52 [Conf]
  7. Ivan M. Havel
    Finite Branching Automata: Automata Theory Motivated by Problem Solving. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:53-61 [Conf]
  8. Peter Mikulecký
    On Configurations in Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:62-68 [Conf]
  9. Klaus W. Wagner, Ludwig Staiger
    Finite Automata Acceptation of Infinite Sequences. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:69-72 [Conf]
  10. Wolfgang Wechler
    R-Fuzzy Automata with a Time-Variant Structure. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:73-76 [Conf]
  11. R. V. Freivald
    Functions Computable in the Limit by Probabilistic Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:77-87 [Conf]
  12. Bernhard Goetze, Reinhard Klette
    Some Properties of Limit Recursive Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:88-90 [Conf]
  13. Beata Konikowska
    On Some Approximation Problems of Continuous Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:91-106 [Conf]
  14. W. Kwasowiec
    Set-Theoretic Properties of Programs in Stored Program Computers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:107-113 [Conf]
  15. Zbigniew W. Ras
    Classification of Programs of a SPC. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:114-125 [Conf]
  16. Jerzy Tiuryn
    The Algebraic Approach to the Theory of Computing Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:126-142 [Conf]
  17. Wojciech Zakowski
    Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real Variables. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:143-156 [Conf]
  18. Ole-Johan Dahl
    An Approach to Correctness Proofs of Semicoroutines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:157-174 [Conf]
  19. Piotr Dembinski
    Towards an Understanding of Complex Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:175-185 [Conf]
  20. Andrzej Skowron
    Simulation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:186-201 [Conf]
  21. Józef Winkowski
    Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:202-221 [Conf]
  22. J. P. Crestin
    Ultralinear Expressions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:222-231 [Conf]
  23. Max Fontet
    A Family of Algebraic Systems Related to the Theory of Equations on Free Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:232-248 [Conf]
  24. Marek Karpinski
    Stretching by Probabilistic Tree Automata and Santos Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:249-255 [Conf]
  25. Jaroslav Král
    Tow Down versus Bottom Up Syntax Analysis Revised. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:256-273 [Conf]
  26. Jan Maluszynski
    Substring Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:274-284 [Conf]
  27. W. A. Owsianiecka
    Defining Languages by Mazurkiewicz Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:285-291 [Conf]
  28. Alica Pirická
    Complexity and Normal Forms of Contex-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:292-297 [Conf]
  29. Gerd Wechsung
    The Axiomatization Problem of a Theory of Linear Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:298-302 [Conf]
  30. Jozef Kelemen
    A Lattice-Theoretical Approach to Problem-Solving. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:303-306 [Conf]
  31. Zenon Kulpa
    On the Equivalence of Planar Grammars and Parallel Picture Processing Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:307-312 [Conf]
  32. Witold Lipski Jr.
    Combinatorial Aspects of Information Storage and Retrieval. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:313-326 [Conf]
  33. Lech Banachowski
    Modular Approach to the Logical Theory of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:327-332 [Conf]
  34. Andrzej Blikle
    Proving Programs by Sets of Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:333-358 [Conf]
  35. Venelin K. Evtimov
    Bases of Paths in Correctness Proofs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:359-360 [Conf]
  36. Hans-Jürgen Hoehnke
    Algebraic Models I. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:361-371 [Conf]
  37. Jacek Irlik
    Structured Programmability of Iterative Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:372-376 [Conf]
  38. Jacek Leszczylowski
    On Equivalence of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:377-380 [Conf]
  39. Jacek Leszczylowski
    Mathematical Model of Programs with Dynamic Allocation of Variables. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:381-387 [Conf]
  40. Pierangelo Miglioli
    Mathematical Foundations of Motivation Languages and Synthesis Maps. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:388-408 [Conf]
  41. Peter D. Mosses
    The Semantics of Semantic Equations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:409-422 [Conf]
  42. Helena Rasiowa
    omega+-Valued Algorithmic Logic as a Tool to Investigate Procedures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:423-450 [Conf]
  43. Willem P. de Roever
    Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:451-463 [Conf]
  44. Andrzej Salwicki
    Procedures, Formal Computations and Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:464-484 [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