Theoretical Computer Science, Volume 267

Volume 267, Number 1-2, 28 September 2001

• Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
  Foreword. 1
  Electronic Edition (link) BibTeX
• Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
  Minimal cover-automata for finite languages. 3-16
  Electronic Edition (link) BibTeX
• Jean-Marc Champarnaud:
  Subset construction complexity for homogeneous automata, position automata and ZPC-structures. 17-34
  Electronic Edition (link) BibTeX
• Jürgen Albert, Dora Giammarresi, Derick Wood:
  Normal form algorithms for extended context-free grammars. 35-47
  Electronic Edition (link) BibTeX
• Norbert Blum:
  On parsing LL-languages. 49-59
  Electronic Edition (link) BibTeX
• Heiko Goeman:
  On parsing and condensing substrings of LR languages in linear time. 61-82
  Electronic Edition (link) BibTeX
• Matti Nykänen:
  Using acceptors as transducers. 83-104
  Electronic Edition (link) BibTeX
• Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque:
  Direct and dual laws for automata with multiplicities. 105-120
  Electronic Edition (link) BibTeX
• Denis Maurel, Brigitte Le Pévédic:
  The syntactic prediction with token automata: application to HandiAS system. 121-129
  Electronic Edition (link) BibTeX
• Thierry Poibeau:
  Parsing natural language idioms with bidirectional finite-state machines. 131-140
  Electronic Edition (link) BibTeX
• Dominique L'Her, Philippe Le Parc, Lionel Marcé:
  Proving sequential function chart programs using timed automata. 141-155
  Electronic Edition (link) BibTeX