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 YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Predictive learning models for concept drift
John Case
,
Sanjay Jain
,
Susanne Kaufmann
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
268
(2), 2001, pp. 323-349
A comparison of identification criteria for inductive inference of recursive real-valued functions
Eiju Hirowatari
,
Setsuo Arikawa
Theoretical Computer Science
268
(2), 2001, pp. 351-366
Closedness properties in ex-identification
Kalvis Aps̄itis
,
Rūsiņs̑ Freivalds
,
Raimonds Simanovskis
,
Juris Smotrovs
Theoretical Computer Science
268
(2), 2001, pp. 367-393
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
The accepting power of unary string logic programs
Tatsuru Matsushita
,
Colin Runciman
Theoretical Computer Science
266
(1-2), 2001, pp. 59-79
Reductions for non-clausal theorem proving
G. Aguilera
,
I.P. de Guzmán
,
M. Ojeda-Aciego
,
A. Valverde
Theoretical Computer Science
266
(1-2), 2001, pp. 81-112
On the asymptotic behaviour of primitive recursive algorithms
René David
Theoretical Computer Science
266
(1-2), 2001, pp. 159-193
Refinement and state machine abstraction
Karl Lermer
,
Paul Strooper
Theoretical Computer Science
266
(1-2), 2001, pp. 195-235
Divergence in testing and readiness semantics
Michele Boreale
,
Rocco De Nicola
,
Rosario Pugliese
Theoretical Computer Science
266
(1-2), 2001, pp. 237-248
A typed context calculus
Masatomo Hashimoto
,
Atsushi Ohori
Theoretical Computer Science
266
(1-2), 2001, pp. 249-272
Subtyping dependent types
David Aspinall
,
Adriana Compagnoni
Theoretical Computer Science
266
(1-2), 2001, pp. 273-309
Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
Manolis Koubarakis
Theoretical Computer Science
266
(1-2), 2001, pp. 311-339
Finitary PCF is not decidable
Ralph Loader
Theoretical Computer Science
266
(1-2), 2001, pp. 341-364
Proof-term synthesis on dependent-type systems via explicit substitutions
César Muñoz
Theoretical Computer Science
266
(1-2), 2001, pp. 407-440
Node rewriting in graphs and hypergraphs: A categorical framework
Michel Bauderon
,
Hélène Jacquet
Theoretical Computer Science
266
(1-2), 2001, pp. 463-487
Partial correctness for probabilistic demonic programs
A.K. MecIver
,
Carroll Morgan
Theoretical Computer Science
266
(1-2), 2001, pp. 513-541
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>