Abstract
Abstract We study “a`la Morse coding” of compact billiards defined on the pseudosphere. As for most bounded systems, the coding is non-exact (except for the non-generic case of tiling billiards). However, two sets of approximate grammar rules can be obtained, one specifying forbidden codes, and the other allowed ones. In-between some sequences remain in the “unknown” zone, but their relative amount can be reduced to zero as one lets the length of the approximate grammar rules go to infinity. The relationship between these approximate grammar rules and the “pruning front” introduced by Cvitanovic`et al. is discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
