Home On ω-languages of special billiards
Article
Licensed
Unlicensed Requires Authentication

On ω-languages of special billiards

  • B.F. Melnikov
Published/Copyright: February 2, 2016

Abstract

We consider non-deterministic initial finite automata without final states and the ω-languages determined by such automata. For such ω-languages, we consider the so-called languages of obstructions. We define and analyse billiard ω-languages determined in a special way for each n ≥ 3 over an alphabet consisting of n letters. Each ω-word of such ω-language can be obtained with the use of infinite number of reflections of a point from the cushions of billiards having the form of a regular n-polygon. For such ω-languages, we consider the languages of obstructions and show that for any n a language of obstructions is not regular.

Published Online: 2016-2-2
Published in Print: 2002-10-1

© 2016 by Walter de Gruyter Berlin/Boston

Downloaded on 30.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2002-0509/html
Scroll to top button