138
click to vote
STACS
15 years 5 months ago
1991 Springer 
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
121
click to vote
STACS
15 years 5 months ago
1991 Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
108
Voted
STACS
15 years 5 months ago
1991 Springer  95
Voted
STACS
15 years 5 months ago
1991 Springer 
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...
87
Voted
STACS
15 years 5 months ago
1991 Springer  |
Theoretical Computer Science