A Rewrite System Associated with Quadratic Pisot Units

  title={A Rewrite System Associated with Quadratic Pisot Units},
  author={Christiane Frougny and Jacques Sakarovitch},
In a previous work, we have investigated an automata-theoretic property of numeration systems associated with quadratic Pisot units that yields, for every such number θ, a certain group Gθ. In this paper, we characterize a cross-section of a congruence γθ ofZ4 that had arisen when constructing Gθ. In spite of the algebraic connections and implications of that characterization, the proof is combinatorial, and based upon rewriting techniques. The main point is to show that the rewrite… 
1 Citations

Two Groups Associated with Quadratic Pisot Units

This paper characterize a cross-section of a congruence γθ of ℤ4 that had arisen when constructing Gθ, that becomes then a second group associated with θ, and is very similar to the symbolic dynamical system associated, by a theorem of Parry, with the two numeration systems attached to θ.



Some operations and transductions that preserve rationality

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad, or from public or private research centers.

Rewrite Systems

  • N. DershowitzJ. Jouannaud
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Easy Multiplications II. Extensions of Rational Semigroups

On the Representation of Finite Deterministic 2-Tape Automata

Finiteness Conditions on Subgroups and Formal Language Theory

We show in this article that the most usual finiteness conditions on a subgroup of a finitely generated group all have equivalent formulations in terms of formal language theory. This correspondence

Bijective Arithmetic Codings of Hyperbolic Automorphisms of the 2-Torus, and Binary Quadratic Forms

AbstractWe study the arithmetic codings of hyperbolic automorphisms of the 2-torus, i.e., the continuous mappings acting from a certain symbolic space of sequences with a finite alphabet endowed with

The "Last" Decision Problem for Rational Trace Languages

It is established here that it is decidable whether a rational set of a free partially commutative monoid (i.e. trace monoid) is recognizable or not if and only if the commutation relation is

An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages

We study here a category whose objects are the pairs (M,P) where M is a monoid and P a subset of M. This gives a suitable algebraic framework for studying the relationships between the properties of