The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Janis Barzdin, Janis Bicevskis, Audris Kalnins
    Construction of Complete Sample System for Correctness Testing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:1-12 [Conf]
  2. Peter van Emde Boas
    Ten Years of Speedup. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:13-29 [Conf]
  3. Petr Hájek
    On Logics of Discovery. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:30-45 [Conf]
  4. Michael A. Harrison
    On Models of Protection in Operating Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:46-60 [Conf]
  5. Jaroslav Král, Jirí Demner
    Parsing as a Subtask of Compiling. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:61-74 [Conf]
  6. Antoni W. Mazurkiewicz
    Parallel Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:75-87 [Conf]
  7. Miroslav Novotný
    On Some Problems Concerning Pawlak's Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:88-100 [Conf]
  8. Arto Salomaa
    Formal Power Series and Growth Functions of Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:101-113 [Conf]
  9. Peter H. Starke
    On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:114-124 [Conf]
  10. Boris A. Trakhtenbrot
    On Problems Solvable by Successive Trials. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:125-137 [Conf]
  11. Vera Trnková
    Automate and Categories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:138-152 [Conf]
  12. I. D. Zaslavskii
    On Some Models of Computability of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:153-159 [Conf]
  13. Jirí Adámek
    Automata and Categories: Finiteness Contra Minimality. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:160-166 [Conf]
  14. A. V. Anisimov
    Languages Over Free Groups. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:167-171 [Conf]
  15. Giorgio Ausiello, Marco Protasi
    On the Comparison of Notions of Approximation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:172-178 [Conf]
  16. M. Benesová, Ivan Korec
    Non-Linear Speed-Up Theorem for Two Register Minsky Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:179-185 [Conf]
  17. Eike Best, Hans Albrecht Schmid
    Systems of Open Paths in Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:186-193 [Conf]
  18. Luc Boasson
    on the Largest Full Sub-AFL of the Full AFL of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:194-198 [Conf]
  19. Michal Chytil
    On Complexity of Nondeterministic Turing Machines Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:199-205 [Conf]
  20. Alexander Ja. Dikovsky
    On Closure Properties of Context-Free Derivation Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:206-211 [Conf]
  21. Venelin K. Evtimov
    Control Structures in Single Block Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:212-218 [Conf]
  22. R. V. Freivald
    Minimal Gödel Numbers and Their Identification in the Limit. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:219-225 [Conf]
  23. Ferenc Gécseg
    Isomorphic Representation of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:226-230 [Conf]
  24. Hartmann J. Genrich
    Extended Simple Regular Expressions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:231-237 [Conf]
  25. Giuseppina C. Gini, Maria L. Gini
    Conniver Programs by Logical Point of View. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:238-245 [Conf]
  26. Jerzy W. Grzymala-Busse
    On the Set of All Automata with the Same Monoid of Endomorphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:246-251 [Conf]
  27. Ivan M. Havel
    Nondterministically Recognizable Sets of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:252-257 [Conf]
  28. Tomás Havránek
    The Approximation Problem in Computational Statistics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:258-265 [Conf]
  29. Klaus Indermark
    The Continuous Algebra of Monadic Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:266-270 [Conf]
  30. Max I. Kanovic
    On Sets of Complex-Programmed Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:271-272 [Conf]
  31. Marek Karpinski
    Decision Algorithms for Havel's Branching Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:273-279 [Conf]
  32. Václav Koubek, Jan Reiterman
    Automata and Categories - Input Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:280-286 [Conf]
  33. Fred Kröger
    Formalization of Algorithmic Reasoning. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:287-293 [Conf]
  34. Giorgio Levi, Franco Sirovich
    Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:294-301 [Conf]
  35. Jan Maluszynski
    A Contribution to Error Recovery. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:302-307 [Conf]
  36. Otto Mayer
    On the Analysis and Synthesis Problems for Context-Free Expressions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:308-314 [Conf]
  37. Kurt Mehlhorn, Zvi Galil
    Monotone Switching Circuits and Boolean Matrix Product. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:315-319 [Conf]
  38. Ivan Mezník
    On Some Lattice-Theoretic Properties of Generable Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:320-325 [Conf]
  39. Larisa S. Modina
    On Some Formal Grammars Generating Dependency Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:326-329 [Conf]
  40. Peter A. Ng, Pei Hsia, Raymond T. Yeh
    Graph Walking Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:330-336 [Conf]
  41. Jürgen Perl
    On Finding All Solutions of the Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:337-343 [Conf]
  42. Alica Pirická-Kelemenová
    Greibach Normal Form Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:344-350 [Conf]
  43. Rimma I. Podlovchenko
    On Correctness and Essentiality of Some Ianov Schemas Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:351-357 [Conf]
  44. Pavel Pudlák
    Polynomially Complete Problems in the Logic of Automated Discovery. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:358-361 [Conf]
  45. Vaclav Rajlich
    Relational definition of Computer Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:362-376 [Conf]
  46. Willem P. de Roever
    First-Order Reductions of Call-by-Name to Call-by-Value. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:377-398 [Conf]
  47. Peter Ruzicka
    Local Disambiguating Transformation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:399-404 [Conf]
  48. Dan A. Simovici
    On Cardinal Sequential Outer Measures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:405-410 [Conf]
  49. Mark B. Trakhtenbrot
    On Representation of Sequential and Parallel Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:411-417 [Conf]
  50. G. E. Tseytlin
    The Theory of the Modified Post Algebras and Multidimensional Automata Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:418-425 [Conf]
  51. Raymond Turner
    An Algebraic Theory of Formal Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:426-431 [Conf]
  52. Mars K. Valiev
    On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:432-438 [Conf]
  53. Rüdiger Valk
    On the Synthesis of Automata with Several Initial States. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:439-444 [Conf]
  54. Klaus W. Wagner
    A Hierarchy of Regular Sequence Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:445-449 [Conf]
  55. Wolfgang Wechler
    R-Fuzzy Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:450-456 [Conf]
  56. Gerd Wechsung
    Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:457-461 [Conf]
  57. Rolf Wiehagen
    Inductive Inference of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:462-464 [Conf]
  58. Józef Winkowski
    Proving Properties of Programs by Means of Predicate Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:465-471 [Conf]
  59. Boleslaw Wojdylo
    A Generalization of Scott's Flow Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:472-476 [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