default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 267
Volume 267, Number 1-2, 28 September 2001
- Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi:
Foreword. 1 - Cezar Câmpeanu
, Nicolae Santean, Sheng Yu:
Minimal cover-automata for finite languages. 3-16 - Jean-Marc Champarnaud:
Subset construction complexity for homogeneous automata, position automata and ZPC-structures. 17-34 - Jürgen Albert, Dora Giammarresi, Derick Wood:
Normal form algorithms for extended context-free grammars. 35-47 - Norbert Blum:
On parsing LL-languages. 49-59 - Heiko Goeman:
On parsing and condensing substrings of LR languages in linear time. 61-82 - Matti Nykänen:
Using acceptors as transducers. 83-104 - Gérard Duchamp, Marianne Flouret, Éric Laugerotte, Jean-Gabriel Luque:
Direct and dual laws for automata with multiplicities. 105-120 - Denis Maurel, Brigitte Le Pévédic:
The syntactic prediction with token automata: application to HandiAS system. 121-129 - Thierry Poibeau:
Parsing natural language idioms with bidirectional finite-state machines. 131-140 - Dominique L'Her, Philippe Le Parc, Lionel Marcé:
Proving sequential function chart programs using timed automata. 141-155
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-02 18:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
