| Publication | Date of Publication | Type |
|---|
Two-dimensional context-free grid grammars
International Journal of Foundations of Computer Science | 2025-04-30 | Paper |
| scientific article; zbMATH DE number 7770055 (Why is no real title available?) | 2023-11-23 | Paper |
Weight-reducing Turing machines
Information and Computation | 2023-05-19 | Paper |
Converting nondeterministic two-way automata into small deterministic linear-time machines
Information and Computation | 2022-12-08 | Paper |
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
Developments in Language Theory | 2022-10-13 | Paper |
Template-based pattern matching in two-dimensional arrays
Lecture Notes in Computer Science | 2022-05-18 | Paper |
| Complexity of two-dimensional rank-reducing grammars | 2021-07-14 | Paper |
Two-dimensional pattern matching against local and regular-like picture languages
Theoretical Computer Science | 2021-06-03 | Paper |
| Two-dimensional pattern matching against basic picture languages | 2020-05-06 | Paper |
| A simple extension to finite tree automata for defining sets of labeled, connected graphs | 2020-05-06 | Paper |
Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
SIAM Journal on Optimization | 2019-08-27 | Paper |
| Two-way automata and one-tape machines. Read only versus linear time | 2018-11-22 | Paper |
| Dynamics of the independence number and automata synchronization | 2018-11-22 | Paper |
LP relaxations of some NP-hard problems are as hard as any LP
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
International Journal of Foundations of Computer Science | 2018-02-22 | Paper |
Undecidability of the emptiness problem for context-free picture languages
Theoretical Computer Science | 2017-06-19 | Paper |
Some classes of rational functions for pictures
RAIRO - Theoretical Informatics and Applications | 2017-03-24 | Paper |
Complexity of sets of two-dimensional patterns
Implementation and Application of Automata | 2016-11-09 | Paper |
Non-recursive trade-offs between two-dimensional automata and grammars
Theoretical Computer Science | 2015-12-10 | Paper |
(Un)decidability of the emptiness problem for multi-dimensional context-free grammars
Implementation and Application of Automata | 2015-09-23 | Paper |
Two-dimensional Sgraffito automata
RAIRO - Theoretical Informatics and Applications | 2015-04-28 | Paper |
Non-recursive Trade-offs between Two-Dimensional Automata and Grammars
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Weight-reducing Hennie machines and their descriptional complexity
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Restarting tiling automata
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Comparing two-dimensional one-marker automata to sgraffito automata
Implementation and Application of Automata | 2013-08-07 | Paper |
New results on deterministic sgraffito automata
Developments in Language Theory | 2013-06-28 | Paper |
Two-dimensional sgraffito automata
Developments in Language Theory | 2012-11-02 | Paper |
Restarting tiling automata
Implementation and Application of Automata | 2012-09-20 | Paper |
| Mathematical formulae recognition | 2009-09-25 | Paper |
