Recursively Enumerable Languages
Edit Page
Report
Scan day: 16 February 2014 UTC
0
Virus safety - good
Description: This chapter shows that the family of regular languages is a proper subset of context free languages and the latter is a proper subset of recursively enumerable languages.
—
Size: 0 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | |
| Keywords: | |
| Description: | |
| IP-address: | 152.3.140.5 |
WHOIS Info
| NS | Name Servers: DNS-AUTH-01.OIT.DUKE.EDU 152.3.103.93 DNS-AUTH-02.OIT.DUKE.EDU 152.3.105.232 |
| WHOIS | |
| Date | activated: 02-Jun-1986 last updated: 11-Jun-2012 expires: 31-Jul-2014 |