Representing recursively enumerable languages by iterated deletion
Theoretical Computer Science
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Kernel methods for learning languages
Theoretical Computer Science
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
A Tableau Calculus for Regular Grammar Logics with Converse
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A Framework for Graded Beliefs, Goals and Intentions
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
Learning linearly separable languages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
A tableau calculus with automaton-labelled formulae for regular grammar logics
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the expressiveness of spider diagrams and commutative star-free regular languages
Journal of Visual Languages and Computing
On the expressiveness of second-order spider diagrams
Journal of Visual Languages and Computing
| Hi-index | 0.00 |