Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
The Algebraic Counterpart of the Wagner Hierarchy
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Schützenberger and Eilenberg theorems for words on linear orderings
Journal of Computer and System Sciences
Schützenberger and eilenberg theorems for words on linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |