Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=267
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal cover-automata for finite languages
C. Câmpeanu
,
N. Sântean
,
S. Yu
Theoretical Computer Science
267
(1-2), 2001, pp. 3-16
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
J.-M. Champarnaud
Theoretical Computer Science
267
(1-2), 2001, pp. 17-34
Normal form algorithms for extended context-free grammars
Jürgen Albert
,
Dora Giammarresi
,
Derick Wood
Theoretical Computer Science
267
(1-2), 2001, pp. 35-47
On parsing LL-languages
Norbert Blum
Theoretical Computer Science
267
(1-2), 2001, pp. 49-59
On parsing and condensing substrings of LR languages in linear time
Heiko Goeman
Theoretical Computer Science
267
(1-2), 2001, pp. 61-82
Using acceptors as transducers
Matti Nykänen
Theoretical Computer Science
267
(1-2), 2001, pp. 83-104
Direct and dual laws for automata with multiplicities
G. Duchamp
,
M. Flouret
,
É. Laugerotte
,
J.-G. Luque
Theoretical Computer Science
267
(1-2), 2001, pp. 105-120
The syntactic prediction with token automata: Application to HandiAS system
Denis Maurel
,
Brigitte le Pévédic
Theoretical Computer Science
267
(1-2), 2001, pp. 121-129
Parsing natural language idioms with bidirectional finite-state machines
T. Poibeau
Theoretical Computer Science
267
(1-2), 2001, pp. 131-140
Proving sequential function chart programs using timed automata
Dominique L'Her
,
Philipppe le Parc
,
Lionel Marcé
Theoretical Computer Science
267
(1-2), 2001, pp. 141-155