Palindromic language of thin discrete planes

DOI10.1016/j.tcs.2015.11.023zbMath1338.68145OpenAlexW2174843677MaRDI QIDQ265052

Eric Domenjoud, Xavier Provençal, Laurent Vuillon

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.023

zbMATH Keywords

discrete planespalindromic languagesvoxel adjacency trees

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Palindromic Complexity of Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of discrete planes
• Minimal arithmetic thickness connecting discrete planes
• Sturmian words: structure, combinatorics, and their arithmetics
• Return words in Sturmian and episturmian words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case
• On the Connecting Thickness of Arithmetical Discrete Planes
• Ergodic properties of a dynamical system arising from percolation theory
• Critical Connectedness of Thin Arithmetical Discrete Planes
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Palindromic language of thin discrete planes