Daniel Goč

Available identifiers

zbMath Open goc.danielMaRDI QIDQ2358682

List of research outcomes

Publication	Date of Publication	Type
State complexity of permutation on finite languages over a binary alphabet	2017-06-15	Paper
A New Approach to the Paperfolding Sequences	2015-10-20	Paper
The State Complexity of Permutations on Finite Languages over Binary Alphabets	2015-08-07	Paper
ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)	2015-04-23	Paper
NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS	2015-02-09	Paper
Computation Width and Deviation Number	2014-08-07	Paper
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS	2014-03-10	Paper
Nondeterministic State Complexity of Proportional Removals	2013-08-09	Paper
Subword Complexity and k-Synchronization	2013-06-28	Paper
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences	2013-03-18	Paper
On the Number of Unbordered Factors	2013-03-18	Paper
Automatic Theorem-Proving in Combinatorics on Words	2012-09-20	Paper

Research outcomes over time

This page was built for person: Daniel Goč