Automatic abelian complexities of Parikh-collinear fixed points

DOI10.1007/S00224-024-10197-5MaRDI QIDQ6661763

Michel Rigo, Markus A. Whiteland, Manon Stipulanti

Publication date: 13 January 2025

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

automated theorem provingautomatic sequenceabelian complexitysubstitution shiftrecognizable morphismParikh-collinear morphism

Mathematics Subject Classification ID

Theory of computing (68Qxx) Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Some unsolved problems
• A characterization of substitutive sequences using return words
• Automatic sequences are also non-uniformly morphic
• The constant of recognizability is computable for primitive morphisms
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Weak Second‐Order Arithmetic and Finite Automata
• Substitutional dynamical systems, Bratteli diagrams and dimension groups
• The spectrum of dynamical systems arising from substitutions of constant length
• Automatic Sequences
• Decidability of the HD0L ultimate periodicity problem
• Abelian Complexity and Synchronization
• Hidden automatic sequences
• The Logical Approach to Automatic Sequences
• Recognizability of morphisms
• Abelian combinatorics on words: a survey
• Automaticity and Parikh-Collinear Morphisms
• Characterizations of families of morphisms and words via binomial complexities

This page was built for publication: Automatic abelian complexities of Parikh-collinear fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661763)