| Publication | Date of Publication | Type |
|---|
The genus of regular languages and directed graph emulators
Theoretical Computer Science | 2024-05-02 | Paper |
| Non-simplifying graph rewriting termination | 2021-05-05 | Paper |
Non-simplifying graph rewriting termination
(available as arXiv preprint) | 2021-05-05 | Paper |
Decidability of regular language genus computation
Mathematical Structures in Computer Science | 2020-05-04 | Paper |
Non-size increasing graph rewriting for natural language processing
Mathematical Structures in Computer Science | 2018-09-05 | Paper |
The genus of regular languages
Mathematical Structures in Computer Science | 2018-01-04 | Paper |
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
Information and Computation | 2016-05-03 | Paper |
Immune Systems in Computer Virology
Evolving Computability | 2015-10-20 | Paper |
Real or natural number interpretation and their effect on complexity
Theoretical Computer Science | 2015-05-26 | Paper |
Intensional properties of polygraphs
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Stochastic Lambek categorial grammars
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
Quasi-interpretations. A way to control resources
Theoretical Computer Science | 2011-06-06 | Paper |
Characterising space complexity classes via Knuth-Bendix orders
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Complexity invariance of real interpretations
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Complexity invariance of real interpretations
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Polygraphic programs and polynomial-time functions
Logical Methods in Computer Science | 2009-06-30 | Paper |
Some Programming Languages for Logspace and Ptime
Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
Towards an Implicit Characterization of NC k
Computer Science Logic | 2009-03-12 | Paper |
Recursion Schemata for NC k
Computer Science Logic | 2008-11-20 | Paper |
Quasi-interpretation Synthesis by Decomposition
Theoretical Aspects of Computing – ICTAC 2007 | 2008-09-17 | Paper |
A Characterization of Alternating Log Time by First Order Functional Programs
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
A Classification of Viruses Through Recursion Theorems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Lexical Disambiguation with Polarities and Automata
Implementation and Application of Automata | 2007-09-06 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 2084367 (Why is no real title available?) | 2004-08-06 | Paper |
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming | 2001-09-09 | Paper |
| scientific article; zbMATH DE number 1342224 (Why is no real title available?) | 1999-09-22 | Paper |
