Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
On the membership of invertible diagonal and scalar matrices
Theoretical Computer Science
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Note: Absoluteness of subword inequality is undecidable
Theoretical Computer Science
Confluence of graph transformation revisited
Processes, Terms and Cycles
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Termination of Graph Rewriting is Undecidable
Fundamenta Informaticae
| Hi-index | 0.00 |