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
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Locality and the complexity of minimalist derivation tree languages
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |