Abstract
The path languages of random permitting context tree languages are investigated. The main result is that these path languages are regular. This confirms a previous conjecture.
Get full access to this article
View all access options for this article.