Home
 
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Keywords
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
  • Volume 27 (1993)
  • no. 1

Table of contents


Prescribed ultrametrics
Higgins, J.; Campbell, D.
p. 1-5

On the structure of recognizable languages of dependence graphs
Ehrenfeucht, A.; Hoogeboom, H. J.; Rozenberg, G.
p. 7-22

A fast algorithm to decide on the equivalence of stateless DPDA
Caucal, Didier
p. 23-48

Efficient reductions of picture words
Brandenburg, Franz J.; Dassow, Jürgen
p. 49-56

PCP-prime words and primality types
Mateescu, Alexandru; Salomaa, Arto
p. 57-70

On languages satisfying “interchange lemma”
Mitrana, Victor
p. 71-79
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of