The SCEAS System
Navigation Menu

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
1973 (conf/mfcs/73)

  1. Ya. M. Barzdin, K. M. Podineks
    Towards a Theory of Inductive Inference (in Russian). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:9-15 [Conf]
  2. Andrzej Blikle
    An Algebraic Approach to Programs and Their Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:17-26 [Conf]
  3. Karel Culík
    Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:27-38 [Conf]
  4. B. Dömölki
    On the Formal Definition of Assembly Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:39-50 [Conf]
  5. Erwin Engeler
    Towards a Galois Theory of Algorithmic Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:51-55 [Conf]
  6. Ferenc Gécseg
    Model Theoretical Methods in the Theory of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:57-63 [Conf]
  7. Seymour Ginsburg
    Substitution and (Semi-)AFL. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:65-69 [Conf]
  8. Jozef Gruska
    Descriptional Complexity of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:71-83 [Conf]
  9. Petr Hájek
    Some Logical Problems of Automated Research. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:85-93 [Conf]
  10. Juris Hartmanis
    On the Problem of Finding Natural Computational Complexity Measures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:95-103 [Conf]
  11. Patrick J. Hayes
    Computation and Deduction. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:105-117 [Conf]
  12. Maurice Nivat
    Operators on Families of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:119-124 [Conf]
  13. Miroslav Novotný
    Constructions of Grammars for Formal Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:125-133 [Conf]
  14. Zdzislaw Pawlak
    Mathematical Foundation of Information Retrieval. [Citation Graph (2, 0)][DBLP]
    MFCS, 1973, pp:135-136 [Conf]
  15. C. A. Petri
    Concepts of Net Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:137-146 [Conf]
  16. Arto Salomaa
    L-Systems: A Device in Biologically Motivated Automata Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:147-151 [Conf]
  17. Claus-Peter Schnorr
    Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:153-161 [Conf]
  18. Peter H. Starke
    On the Sequential Relations of Time-Invariant Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:163-168 [Conf]
  19. Luigia Carlucci Aiello, Ugo Montanari
    Towards a Formal Definition of the Control in Structured Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:169-174 [Conf]
  20. A. V. Anisimov
    Top-down Analysis of Programming Languages without Backtrack (in Russian). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:175-180 [Conf]
  21. W. Bartol
    Semiboolean Algebras of Submachines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:181-183 [Conf]
  22. Alberto Bertoni
    Equations of Formal Power Series over Non Commutative Semiring. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:185-190 [Conf]
  23. Wilfried Brauer
    On Grammatical Complexity of Context-Free Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:191-196 [Conf]
  24. Michal Chytil
    On Changes of Input/Output Coding. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:197-201 [Conf]
  25. J. P. Cleave
    Combinatorial Problems III. Degrees of Combinatorial Problems of Computing Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:203-207 [Conf]
  26. Armin B. Cremers, Otto Mayer
    On Vector Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:209-213 [Conf]
  27. Robert P. Daley
    The Process Complexity and the Understanding of Sequences. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:215-218 [Conf]
  28. A. A. Donis
    Conditional Metric Completeness of Finite Sets of Automata: A Criterion and an Algorithm (in Russian). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:219-224 [Conf]
  29. Philippe Flajolet, Jean-Marc Steyaert
    Decision Problems for Multihead Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:225-230 [Conf]
  30. Jerzy W. Grzymala-Busse
    On the Connectivity of the Periodic Sum of Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:231-234 [Conf]
  31. J. Horejs
    An Algebraic Model for Parallel Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:235-238 [Conf]
  32. Klaus Indermark
    On Ianov Schemas with One Memory Location. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:239-245 [Conf]
  33. Ivan Korec
    Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:247-250 [Conf]
  34. Jaroslav Král
    Some Sources of Primitive Constructs in Programming Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:251-254 [Conf]
  35. Herbert Küstner
    An Algebraic Characterization of Stochastic Finite-State Automata and Their Behaviour Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:255-258 [Conf]
  36. Daniele Marini, Pierangelo Miglioli
    Characterization of Programs and Their Synthesis from a Formalized Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:259-266 [Conf]
  37. Jaroslav Morávek
    Computational Optimality of a Dynamic Programming Method. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:267-270 [Conf]
  38. Miloslav Nekvinda
    On the Complexity of Countable Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:271-272 [Conf]
  39. Peter A. Ng, Raymond T. Yeh
    Tree Transformations via Finite Recursive Transition Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:273-277 [Conf]
  40. I. Peák, N. Q. Khang
    On Endomorphism Semigroup of Nilpotent Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:279-284 [Conf]
  41. Vaclav Rajlich
    Relational Structures and Dynamics of Certain Discrete Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:285-291 [Conf]
  42. Willem P. de Roever
    Operational and Mathematical Semantics for Recursive Polyadic Program Schemata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:293-298 [Conf]
  43. Branislav Rovan
    Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:299-305 [Conf]
  44. L. G. Samoilenko
    Construction and Properties of Context-Sensitive Grammars and Languages (in Russian). [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:307-311 [Conf]
  45. Dan A. Simovici
    On Some Measures on Free Semigroups Induced by Semiautomata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:313-316 [Conf]
  46. Andrzej Skowron
    Machines with Input and Output. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:317-319 [Conf]
  47. Olga Stepánková, Ivan M. Havel
    Some Results Concerning the Situation Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:321-326 [Conf]
  48. Hans-Georg Stork
    A Note on Improving Input Strings for Paging Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:327-330 [Conf]
  49. Pavel Strnad
    Turing Machine Recognition. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:331-332 [Conf]
  50. Ivan Hal Sudborough, A. Zalcberg
    On Families of Languages Defined by Time-Bounded Random Access Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:333-338 [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