Automaticity of primitive words and irreducible polynomials

Automaticity of primitive words and irreducible polynomials

Automata, Logic and Semantics

Bibliographic Details
Main Authors:	Anne Lacroix, Narad Rampersad
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2013-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/632/pdf

Similar Items

Cubefree words with many squares
by: James Currie, et al.
Published: (2010-01-01)

Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)

Words and bisimulations of dynamical systems
by: Thomas Brihaye
Published: (2007-01-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)

Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)

q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01)

On the length of shortest 2-collapsing words
by: Alessandra Cherubini, et al.
Published: (2009-01-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Enumeration of words by the sum of differences between adjacent letters
by: Toufik Mansour
Published: (2009-01-01)

A geometrical approach of palindromic factors of standard billiard words
by: Jean-Pierre Borel
Published: (2007-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
by: Manfred Kufleitner, et al.
Published: (2012-06-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

A bound on the number of perfect matchings in Klee-graphs
by: Marek Cygan, et al.
Published: (2013-01-01)

Sequence variations of the 1-2-3 conjecture and irregularity strength
by: Ben Seamone, et al.
Published: (2013-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

A new characterization and a recognition algorithm of Lucas cubes
by: Andrej Taranenko
Published: (2013-10-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
by: Rafal Witkowski, et al.
Published: (2013-11-01)

Two player game variant of the Erd\H os-Szekeres problem
by: Parikshit Kolipaka, et al.
Published: (2013-11-01)

The Magnus-Derek game in groups
by: Dániel Gerbner
Published: (2013-11-01)

Surjective cellular automata far from the Garden of Eden
by: Silvio Capobianco, et al.
Published: (2013-10-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

Robot's hand and expansions in non-integer bases
by: Paola Loreti, et al.
Published: (2014-06-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)