5 citations · 6 across the 7 of their papers we have counts for
8 papers
Abduction Prover in Isabelle/HOL
Yutaka Nagashima, Daniel Sebastian Goc
Proof assistants based on expressive logics suffer limited automation for proof search, raising the cost of formal verification based on proof assistants. We address this problem b…
On Channel Simulation with Causal Rejection Samplers
Daniel Goc, Gergely Flamich
One-shot channel simulation has recently emerged as a promising alternative to quantization and entropy coding in machine-learning-based lossy data compression schemes. However, wh…
Template-Based Conjecturing for Automated Induction in Isabelle/HOL
Yutaka Nagashima, Zijin Xu, Ningli Wang +2
Proof by induction plays a central role in formal verification. However, its automation remains as a formidable challenge in Computer Science. To solve inductive problems, human en…
On the Number of Unbordered Factors
Daniel Goc, Hamoon Mousavi, Jeffrey Shallit
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We s…
Least periods of k-automatic sequences
Daniel Goc, Jeffrey Shallit
Currie and Saari initiated the study of least periods of infinite words, and they showed that every integer n >= 1 is a least period of the Thue-Morse sequence. We generalize this…
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
Daniel Goc, Kalle Saari, Jeffrey Shallit
We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-aut…