List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The descriptional power of queue automata of constant length Acta Informatica | 2021-07-23 | Paper |
| Descriptional complexity of pushdown store languages | 2015-03-16 | Paper |
| Parameterized Prefix Distance between Regular Languages SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
| Queue automata of constant length Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
| A direct construction of finite state automata for pushdown store languages Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
| Descriptional complexity of pushdown store languages Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
| Nondeterministic state complexity of star-free languages Theoretical Computer Science | 2012-08-09 | Paper |
| Nondeterministic state complexity of star-free languages Implementation and Application of Automata | 2011-07-29 | Paper |
Research outcomes over time
This page was built for person: Katja Meckel
