Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 1998

23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Luboš Brim
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jozef Gruska
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jiří Zlatuška
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1450)

Included in the following conference series:

Conference proceedings info: MFCS 1998.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (82 papers)

  1. Reducing AC-termination to termination

    • Maria C. F. Ferreira, Delia Kesner, Laurence Puel
    Pages 239-247

  2. On one-pass term rewriting

    • Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi
    Pages 248-256

  3. On the word, subsumption, and complement problem for recurrent term schematizations

    • Miki Hermann, Gernot Salzer
    Pages 257-266

  4. Encoding the hydra battle as a rewrite system

    • Hélène Touzet
    Pages 267-276

  5. Computing ε-free NFA from regular expressions in O(n log2(N)) time

    • Christian Hagenah, Anca Muscholl
    Pages 277-285

  6. Iterated length-preserving rational transductions

    • Michel Latteux, David Simplot, Alain Terlutte
    Pages 286-295

  7. The head hierarchy for oblivious finite automata with polynomial advice collapses

    • Holger Petersen
    Pages 296-304

  8. The equivalence problem for deterministic pushdown transducers into abelian groups

    • Géraud Sénizergues
    Pages 305-315

  9. The semi-full closure of Pure Type Systems

    • Gilles Barthe
    Pages 316-325

  10. Predicative polymorphic subtyping

    • Marcin Benke
    Pages 326-335

  11. A computational interpretation of the λΜ-calculus

    • G. M. Bierman
    Pages 336-345

  12. Polymorphic subtyping without distributivity

    • Jacek Chrząszcz
    Pages 346-355

  13. A (non-elementary) modular decision procedure for LTrL

    • Paul Gastin, Raphaël Meyer, Antoine Petit
    Pages 356-365

  14. Complete abstract interpretations made constructive

    • Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
    Pages 366-377

  15. Timed bisimulation and open maps

    • Thomas Hune, Mogens Nielsen
    Pages 378-387

  16. Deadlocking states in context-free process algebra

    • Jiří Srba
    Pages 388-398

  17. A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates

    • Kazuyuki Amano, Akira Maruoka
    Pages 399-408

  18. On counting ac 0 circuits with negative constants

    • Andris Ambainis, David Mix Barrington, Huong LêThanh
    Pages 409-417

  19. A second step towards circuit complexity-theoretic analogs of Rice's theorem

    • Lane A. Hemaspaandra, Jörg Rothe
    Pages 418-426

  20. Model checking Real-Time properties of symmetric systems

    • E. Allen Emerson, Richard J. Trefler
    Pages 427-436
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1998

Keywords

About this book

This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998.
The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation