Palindromic language of thin discrete planes

DOI10.1016/J.TCS.2015.11.023zbMATH Open1338.68145OpenAlexW2174843677MaRDI QIDQ265052FDOQ265052

Authors: Eric Domenjoud, Xavier Provençal, L. 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

Recommendations

• Facet connectedness of discrete hyperplanes with zero intercept: the general case
• Connectivity of discrete planes
• Combinatorial Image Analysis
• Critical connectedness of thin arithmetical discrete planes
• Facet connectedness of arithmetic discrete hyperplanes with non-zero shift

zbMATH Keywords

discrete planespalindromic languagesvoxel adjacency trees

Mathematics Subject Classification ID

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

Cites Work

• Minimal arithmetic thickness connecting discrete planes
• Sturmian words: structure, combinatorics, and their arithmetics
• Return words in Sturmian and episturmian words
• Geometric palindromic closure
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Episturmian words and some constructions of de Luca and Rauzy
• Connectivity of discrete planes

Cited In (1)

• Palindromic complexity of trees

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

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