Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |