State Complexity of Reversals of Deterministic Finite Automata with Output

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has $n$ states and $k$ possible output values, there is a known upper bound of $k^n$ for the state complexity of reversal. We show this bound can be reached with a ternary input alphabet. We conjecture it cannot be reached with a binary input alphabet except when $k = 2$, and give a lower bound for the case $3 \le k < n$. We prove that the state complexity of reversal depends solely on the transition monoid of the DFAO and the mapping that assigns output values to states.Comment: 18 pages, 3 tables. Added missing affiliation/funding informatio

Canonical Representatives of Morphic Permutations

An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutation can be constructed with an aperiodic infinite word over $\{0,\ldots,q-1\}$ as the lexicographic order of the shifts of the word. In this paper, we discuss the question if an infinite permutation defined this way admits a canonical representative, that is, can be defined by a sequence of numbers from [0, 1], such that the frequency of its elements in any interval is equal to the length of that interval. We show that a canonical representative exists if and only if the word is uniquely ergodic, and that is why we use the term ergodic permutations. We also discuss ways to construct the canonical representative of a permutation defined by a morphic word and generalize the construction of Makarov, 2009, for the Thue-Morse permutation to a wider class of infinite words.Comment: Springer. WORDS 2015, Sep 2015, Kiel, Germany. Combinatorics on Words: 10th International Conference. arXiv admin note: text overlap with arXiv:1503.0618

The Critical Exponent is Computable for Automatic Sequences

The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is computable. Our results also apply to variants of the critical exponent, such as the initial critical exponent of Berthe, Holton, and Zamboni and the Diophantine exponent of Adamczewski and Bugeaud. Our work generalizes or recovers previous results of Krieger and others, and is applicable to other situations; e.g., the computation of the optimal recurrence constant for a linearly recurrent k-automatic sequence.Comment: In Proceedings WORDS 2011, arXiv:1108.341

Multifractal eigenstates of quantum chaos and the Thue-Morse sequence

We analyze certain eigenstates of the quantum baker's map and demonstrate, using the Walsh-Hadamard transform, the emergence of the ubiquitous Thue-Morse sequence, a simple sequence that is at the border between quasi-periodicity and chaos, and hence is a good paradigm for quantum chaotic states. We show a family of states that are also simply related to Thue-Morse sequence, and are strongly scarred by short periodic orbits and their homoclinic excursions. We give approximate expressions for these states and provide evidence that these and other generic states are multifractal.Comment: Substantially modified from the original, worth a second download. To appear in Phys. Rev. E as a Rapid Communicatio

Retention mechanisms and binding states of deuterium implanted into beryllium

doi:10.1088/1367-2630/11/4/043023 Abstract. The retention of 1 keV D+ ions implanted into clean and oxidized single crystalline Be at room and elevated temperatures is investigated by a combination of in situ analytical techniques including temperature programmed desorption (TPD), nuclear reaction analysis, low-energy ion spectroscopy (LEIS) and x-ray photoelectron spectroscopy. For the first time, the whole temperature regime for deuterium release and the influence of thin oxide films on the release processes are clarified. The cleaned and annealed Be sample has residual oxygen concentration equivalent to 0.2monolayer (ML) BeO in the near-surface region as the only contamination. LEIS shows that Be from the volume covers thin BeO surface layers above an annealing temperature of 1000K by segregation, forming a pure Be-terminated surface, which is stable at lower temperatures until again oxidized by residual gas. No deuterium is retained in the sample above 950K. By analyzing TPD spectra, active retention mechanisms and six energetically different binding states are identified. Activation energies (EA

Shuffling cards, factoring numbers, and the quantum baker's map

It is pointed out that an exactly solvable permutation operator, viewed as the quantization of cyclic shifts, is useful in constructing a basis in which to study the quantum baker's map, a paradigm system of quantum chaos. In the basis of this operator the eigenfunctions of the quantum baker's map are compressed by factors of around five or more. We show explicitly its connection to an operator that is closely related to the usual quantum baker's map. This permutation operator has interesting connections to the art of shuffling cards as well as to the quantum factoring algorithm of Shor via the quantum order finding one. Hence we point out that this well-known quantum algorithm makes crucial use of a quantum chaotic operator, or at least one that is close to the quantization of the left-shift, a closeness that we also explore quantitatively.Comment: 12 pgs. Substantially elaborated version, including a new route to the quantum bakers map. To appear in J. Phys.

Nivat's conjecture holds for sums of two periodic configurations

Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often understood as colorings of a two-dimensional square grid. Let $P_c(m,n)$ denote the number of distinct $m \times n$ block patterns occurring in a configuration $c$. Configurations satisfying $P_c(m,n) \leq mn$ for some $m,n \in \mathbb N$ are said to have low rectangular complexity. Nivat conjectured that such configurations are necessarily periodic. Recently, Kari and the author showed that low complexity configurations can be decomposed into a sum of periodic configurations. In this paper we show that if there are at most two components, Nivat's conjecture holds. As a corollary we obtain an alternative proof of a result of Cyr and Kra: If there exist $m,n \in \mathbb N$ such that $P_c(m,n) \leq mn/2$, then $c$ is periodic. The technique used in this paper combines the algebraic approach of Kari and the author with balanced sets of Cyr and Kra.Comment: Accepted for SOFSEM 2018. This version includes an appendix with proofs. 12 pages + references + appendi