225
click to vote
STACS
15 years 11 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...
216
Voted
STACS
15 years 11 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....
173
Voted
STACS
15 years 11 months ago
1991 Springer  167
Voted
STACS
15 years 11 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 ...
|
Theoretical Computer Science