Infinite labeled trees: from rational to Sturmian trees
From MaRDI portal
Publication:2268875
Recommendations
Cites work
- Digital straightness -- a review
- Discrete-event control of stochastic networks: multimodularity and regularity.
- Extremal Splittings of Point Processes
- Fundamental properties of infinite trees
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 3435566 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1400043 (Why is no real title available?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS
- Random generation of finite Sturmian words
- Sturmian and Episturmian Words
- The On-Line Encyclopedia of Integer Sequences
Cited in
(9)- Periodicities on trees
- \(\mathbb{R}\)-trees and the Bieri-Neumann-Strebel invariant
- Tree shift topological entropy
- Breadth-first serialisation of trees and rational languages (short paper)
- A First Investigation of Sturmian Trees
- scientific article; zbMATH DE number 809135 (Why is no real title available?)
- Subword complexity and Sturmian colorings of regular trees
- Full-splitting Miller trees and infinitely often equal reals
- Sturmian trees
This page was built for publication: Infinite labeled trees: from rational to Sturmian trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268875)
