Run languages
β Scribed by J.A. Brzozowski
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 380 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The family ~ of run languages is a generalization of the family of finite/cofinite languages. For an alphabet A, the family 'W e of "ewords" consists of finite products of factors each of which is of the form {a} or a Β§ a EA, and ~ is the Boolean closure of "We-It is shown that each run language or its complement is a finite union of ~words, and that ~ is also the Boolean closure of "W Β§ lhe set of "words" over {a+: a E A}. Lastly we prove that ~ is contained in the family "Yt of languages whose syntactic monoids are ~-trivial, and that for a two-letter alphabet ~ = "y~.
π SIMILAR VOLUMES
"When a mother and her child are pulled out of the harbor in their car, the case seems pretty straightforward for Miami PD and Detective Harry Hunter. Everything points to a murder-suicide. They were homeless, living in their car, and the mother decided to end it all for them both by driving into th
You are a lost girl who has fallen into the abyss. Maybe I pushed you.Β Maybe I just found you down there. Iβm not here to pull you out, Emilia. Iβm here to catch you should you ever want to escape. You seem attracted to darkness. IΒ amΒ darkness, baby. Run!