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 |
|---|---|---|
| State complexity of permutation on finite languages over a binary alphabet Theoretical Computer Science | 2017-06-15 | Paper |
| A new approach to the paperfolding sequences Evolving Computability | 2015-10-20 | Paper |
| The state complexity of permutations on finite languages over binary alphabets Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
| On the number of abelian bordered words (with an example of automatic theorem-proving) International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
| Nondeterministic state complexity of proportional removals International Journal of Foundations of Computer Science | 2015-02-09 | Paper |
| Computation width and deviation number Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
| Automatic theorem-proving in combinatorics on words International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
| Nondeterministic state complexity of proportional removals Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
| Subword complexity and \(k\)-synchronization Developments in Language Theory | 2013-06-28 | Paper |
| Primitive words and Lyndon words in automatic and linearly recurrent sequences Language and Automata Theory and Applications | 2013-03-18 | Paper |
| On the number of unbordered factors Language and Automata Theory and Applications | 2013-03-18 | Paper |
| Automatic Theorem-Proving in Combinatorics on Words Implementation and Application of Automata | 2012-09-20 | Paper |
Research outcomes over time
This page was built for person: Daniel Goč
