Related papers: Plane-Walking Automata
We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic…
Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies these are nondegenerate maxima, minima, and…
We define a class of groups based on parallel computations by pushdown automata. This class generalizes automatic groups. It includes the fundamental groups of all 3-manifolds which obey Thurston' s geometrization conjecture. It also…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
We prove that relational structures admitting specific polymorphisms (namely, canonical pseudo-WNU operations of all arities $n \geq 3$) have low relational width. This implies a collapse of the bounded width hierarchy for numerous classes…
Higher-dimensional automata (HDA) are a formalism to faithfully model the behaviour of concurrent systems. For ordinary automata, there is a correspondence between regular expressions, regular languages and finite automata, which provides a…
We introduce an algorithm for model-based hierarchical reinforcement learning to acquire self-contained transition and reward models suitable for probabilistic planning at multiple levels of abstraction. We call this framework Planning with…
A two-dimensional automaton operates on arrays of symbols. While a standard (four-way) two-dimensional automaton can move its input head in four directions, restricted two-dimensional automata are only permitted to move their input heads in…
The global symmetries of a $D$-dimensional QFT can, in many cases, be captured in terms of a $(D+1)$-dimensional symmetry topological field theory (SymTFT). In this work we construct a $(D+1)$-dimensional theory which governs the symmetries…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $\epsilon$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…
We observe a novel 'multiple-descent' phenomenon during the training process of LSTM, in which the test loss goes through long cycles of up and down trend multiple times after the model is overtrained. By carrying out asymptotic stability…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
A 3-dimensional homotopy quantum field theory (HQFT) can be described as a TQFT for surfaces and 3-cobordisms endowed with homotopy classes of maps into a given space. For a group $\pi$, we introduce a notion of a modular crossed…
This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper…
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we…
We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous, oblivious, dis-oriented, and without any communication…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
Given a topologically transitive subshift of finite type, the $u$-dimension of the $\alpha$-level set of the quotient of Birkhoff sums is a well-studied topic. In this paper, we consider the uniform $\alpha$-level set, which is a subset of…