output
20062021
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
collaborating institutions
Showing 2018Show all

5 papers · 1 filter

cs.CC2018★ 2 cited

Unifying lower bounds for algebraic machines, semantically

Thomas Seiller, Luc Pellissier, Ulysse Léchine

This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it…

cs.CC2018

Undecidable word problem in subshift automorphism groups

Pierre Guillon, Emmanuel Jeandel, Jarkko Kari +1

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose aut…

cs.DM2018★ 2 cited

Slopes of 3-dimensional Subshifts of Finite Type

Etienne Moutot, Pascal Vanier

In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope…

cs.DM2018★ 1 cited

Aperiodic points in -subshifts

Anael Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier

We consider the structure of aperiodic points in -subshifts, and in particular the positions at which they fail to be periodic. We prove that if a -subshi…

cs.LO2018

Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD)

Régine Laleau, Dominique Méry, Shin Nakajima +1

This volume contains the joint proceedings of IMPEX 2017, the first workshop on Handling IMPlicit and EXplicit knowledge in formal system development and FM&MDD, the second worksho…