On the Theory of One-Step Rewriting in Trace Monoids
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Solutions and query rewriting in data exchange
Information and Computation
| Hi-index | 0.00 |