Grammars for Regular Languages
Edit Page
Report
Scan day: 16 February 2014 UTC
3
Virus safety - good
Description: A series of pages showing that a regular grammar is either a right-linear or left-linear grammar.
CSC 4170 Grammars for Regular Languages A language defined by a dfa is a regular language. Any dfa can be regarded as a special case of an nfa. Any nfa can be converted to an equivalent dfa; thus, a language defined by an nfa is a regular language.
Size: 248 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | CSC 4170 Grammars for Regular Languages |
| Keywords: | |
| Description: | |
| IP-address: | 158.130.68.91 |
WHOIS Info
| NS | Name Servers: ADNS1.UPENN.EDU 128.91.3.128, 2607:f470:1001::1:a ADNS2.UPENN.EDU 128.91.254.22, 2607:f470:1002::2:3 |
| WHOIS | |
| Date | activated: 02-Jun-1986 last updated: 14-Jan-2014 expires: 31-Jul-2014 |