The SCEAS System
Navigation Menu

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
1991 (conf/mfcs/91)

  1. Jean-Louis Lassez, Michael J. Maher, Kim Marriott
    Elimination of Negation in Term Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:1-16 [Conf]
  2. Pierre Lescanne
    Rewrite Orderings and Termination of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:17-27 [Conf]
  3. Zohar Manna, Amir Pnueli
    On the Faithfulness of Formal Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:28-42 [Conf]
  4. Mogens Nielsen
    Models for Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:43-46 [Conf]
  5. Andrzej Salwicki
    On a Hierarchy of File Types and a Tower of Their Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:47-63 [Conf]
  6. Fabio Alessi, Franco Barbanera
    Strong Conjunction and Intersection Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:64-73 [Conf]
  7. Egidio Astesiano, Maura Cerioli
    Partial Higher-Order Specifications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:74-83 [Conf]
  8. Staffan Bonnier
    Unification in Incompletely Specified Theories: A Case Study. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:84-92 [Conf]
  9. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    Observing Localities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:93-102 [Conf]
  10. Gerardo Costa, Gianna Reggio
    Abstract Dynamic Data Types: A Temporal Logic Approach. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:103-112 [Conf]
  11. Anton Cerný
    Generating Words by Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:113-120 [Conf]
  12. Pierpaolo Degano, Roberto Gorrieri
    Atomic Refinement in Process Description Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:121-130 [Conf]
  13. Volker Diekert, Paul Gastin, Antoine Petit
    Recognizable Complex Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:131-140 [Conf]
  14. Eric Domenjoud
    Solving Systems of Linear Diophantine Equations: An Algebraic Approach. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:141-150 [Conf]
  15. Gilles Dowek
    A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:151-160 [Conf]
  16. Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca
    The lazy call-by-value Lamda-Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:161-169 [Conf]
  17. Roberto Gorrieri, Cosimo Laneve
    The Limit of Split_n-Bisimulations for CCS Agents. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:170-180 [Conf]
  18. Georges Hansel, Daniel Krob, Christian Michaux
    Stochastic Automata and Length Distributions of Rational Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:181-190 [Conf]
  19. Barney P. Hilken, David E. Rydeheard
    Towards a Categorical Semantics Type Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:191-201 [Conf]
  20. Rodney R. Howell, Petr Jancar, Louis E. Rosier
    Single-Path Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:202-210 [Conf]
  21. Juraj Hromkovic, Burkhard Monien
    The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:211-220 [Conf]
  22. Oscar H. Ibarra, Tao Jiang, Hui Wang
    Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:221-230 [Conf]
  23. Paola Inverardi, Monica Nesi
    Infinite Normal Forms for Non-Linear Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:231-239 [Conf]
  24. Petteri Jokinen, Esko Ukkonen
    Two Algorithms for Approximate String Matching in Static Texts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:240-248 [Conf]
  25. Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
    Efficient Constructions of Test Sets for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:249-258 [Conf]
  26. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis
    The Complexity of The Reliable Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:259-266 [Conf]
  27. Delia Kesner
    Pattern Matching in Order-Sorted Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:267-276 [Conf]
  28. Beata Konikowska
    Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:277-286 [Conf]
  29. Emmanuel Kounalis, Denis Lugiez, Loic Pottier
    A Solution of the Complement Problem in Associative-Commutative Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:287-297 [Conf]
  30. Padmanabhan Krishnan
    A Model for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:298-307 [Conf]
  31. Nguyen Huong Lam, Do Long Van
    On Strict Codes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:308-317 [Conf]
  32. Hans Leiß, Fritz Henglein
    A Decidable Case of the Semi-Unification Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:318-327 [Conf]
  33. Claudia Leopold
    Maintaining Dictionaries in a Hierarchical Memory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:328-336 [Conf]
  34. Christoph Meinel, Stephan Waack
    Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:337-345 [Conf]
  35. Ugo Montanari, Vladimiro Sassone
    CCS Dynamic Bisimulation is Progressing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:346-356 [Conf]
  36. M. A. Nait Abdallah
    Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:357-366 [Conf]
  37. Damian Niwinski
    On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:367-376 [Conf]
  38. Barbara Paech
    Extending Temporal Logic by Explicit Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:377-386 [Conf]
  39. Ramón Pino Pérez
    An Extensional Partial Combinatory Algebra Based on Lamda-Terms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:387-396 [Conf]
  40. Axel Poigné
    Once More on Order-Sorted Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:397-405 [Conf]
  41. Yves Roos, Pierre-André Wacrenier
    Composition of Two Semi Commutations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:406-414 [Conf]
  42. Peter Ruzicka
    An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:415-425 [Conf]
  43. Konstantin V. Shvachko
    Different Modifications of Pointer Machines and Their Computational Power. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:426-435 [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