Table of contents
Table of contents
Theoretical Informatics and Applications
Informatique théorique et applications
ITA, Vol. 33, No 3, 1999
- p 213
- Unavoidable set: extension and reduction
Phan Trung Huy, Nguyen Huong Lam
Abstract | PDF file (305 Kb)
- p 227
- Normalisation of the Theory T of Cartesian Closed Categories and
Conservativity of Extensions T[x] of T
Anne Preller, P. Duroux
Abstract | PDF file (410 Kb)
- p 259
- On existentially first-order
definable languages and their relation to NP
Bernd Borchert, Dietrich Kuske, Frank Stephan
Abstract | PDF file (316 Kb)
- p 271
- There is no complete axiom system
for shuffle expressions
A. Szepietowski
Abstract | PDF file (252 Kb)
- p 279
- Non-looping string rewriting
Alfons Geser, Hans Zantema
Abstract | PDF file (443 Kb)
- p 303
- Lower space bounds for accepting shuffle languages
Andrzej Szepietowski
Abstract | PDF file (243 Kb)