Add to ORKGInternational audienceWe introduce a new class of subshifts of sequences, called generalized Dyck shifts, which extends the class of Dyck shifts introduced by Krieger. The finite factors of these shifts are factors of generalized Dyck words. Generalized Dyck words were introduced by Labelle and Yeh who exhibited unambiguous algebraic grammars generating these context-free languages. Other unambiguous algebraic grammars for generalized Dyck languages were found by Duchon. We define a coding of periodic patterns of generalized Dyck shifts which allows to compute their zeta function. We prove that the zeta function of a generalized Dyck shift is the commutative image of the generating function of an unambiguous context-free language and is thu...
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a M...
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite alph...
This paper focuses on certain context-free dynamical systems within the framework of symbolic dynami...
International audienceWe introduce a new class of subshifts of sequences, called generalized Dyck sh...
Abstract. Constrained coding is a technique for converting unrestric-ted sequences of symbols into c...
Abstract—Constrained coding is a technique for converting unrestricted sequences of symbols into con...
International audienceWe define the class of sofic-Dyck shifts which extends the class of Markov-Dyc...
International audienceWe introduce a new class of subshifts of sequences, called k-graph shifts, whi...
AbstractWe provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle a...
Abstract—A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequenc...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
For a discrete dynamical system, the prime orbit and Mertens’ orbit counting functions describe the ...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian d...
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a M...
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite alph...
This paper focuses on certain context-free dynamical systems within the framework of symbolic dynami...
International audienceWe introduce a new class of subshifts of sequences, called generalized Dyck sh...
Abstract. Constrained coding is a technique for converting unrestric-ted sequences of symbols into c...
Abstract—Constrained coding is a technique for converting unrestricted sequences of symbols into con...
International audienceWe define the class of sofic-Dyck shifts which extends the class of Markov-Dyc...
International audienceWe introduce a new class of subshifts of sequences, called k-graph shifts, whi...
AbstractWe provide a new algebraic grammar for generalized Dyck languages as introduced by Labelle a...
Abstract—A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequenc...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
Abstract We define a bijection between permutations and valued Dyck paths, namely, Dyck paths whos...
For a discrete dynamical system, the prime orbit and Mertens’ orbit counting functions describe the ...
AbstractIn this article, we construct a family of infinite words, generated by countable automata an...
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian d...
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a M...
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite alph...
This paper focuses on certain context-free dynamical systems within the framework of symbolic dynami...