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.
You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/