Volume 42; Issue 3

Information Processing Letters

Volume 42; Issue 3
2

Which finite monoids are syntactic monoids of rational ω-languages

Year:
1992
Language:
english
File:
PDF, 534 KB
english, 1992
3

On the editing distance between unordered labeled trees

Year:
1992
Language:
english
File:
PDF, 538 KB
english, 1992
4

Optimal value for the Newton-Raphson division algorithm

Year:
1992
Language:
english
File:
PDF, 298 KB
english, 1992
5

A note on lower bounds for rectilinear Steiner trees

Year:
1992
Language:
english
File:
PDF, 98 KB
english, 1992
6

Finitary logics for some CCS observational bisimulations

Year:
1992
Language:
english
File:
PDF, 438 KB
english, 1992
7

A short proof of the decidability of bisimulation for normed bpa-processes

Year:
1992
Language:
english
File:
PDF, 388 KB
english, 1992
9

Finding good approximate vertex and edge partitions is NP-hard

Year:
1992
Language:
english
File:
PDF, 639 KB
english, 1992