Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
The equational theory of regular words
Information and Computation
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
An automata-theoretic approach to the word problem for ω -terms over R
Theoretical Computer Science
Context-Free Languages of Countable Words
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
The equational theory of regular words
Information and Computation
Regular and algebraic words and ordinals
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Fundamenta Informaticae
Theoretical Computer Science
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Fundamenta Informaticae
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
A context-free linear ordering with an undecidable first-order theory
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 5.23 |