The following pages link to Daniel Goč (Q2358682):
Displaying 12 items.
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Nondeterministic State Complexity of Proportional Removals (Q2843088) (← links)
- Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
- A New Approach to the Paperfolding Sequences (Q3195678) (← links)
- On the Number of Unbordered Factors (Q4910467) (← links)
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (Q4910468) (← links)
- NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) (Q5247177) (← links)
- Subword Complexity and k-Synchronization (Q5300845) (← links)
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556) (← links)
- Computation Width and Deviation Number (Q5496185) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
