SkipCaptcha
265
edits
Changes
Jump to navigation
Jump to search
Line 315:
Line 315: − * [anything] -> [anything]+ + + + + + + + + +
→Chomsky hierarchy: add 'beyond level 0'
A recursively enumerable grammar has absolutely no restriction on what sort of transformation rules can be applied. Rules take the general form:
A recursively enumerable grammar has absolutely no restriction on what sort of transformation rules can be applied. Rules take the general form:
[anything] -> [anything]
===Beyond Level 0===
These lecture notes
<ref>{{cite web
| url = http://www.google.co.uk/url?sa=t&rct=j&q=recursively+enumerable+languages+examples&source=web&cd=4&ved=0CF4QFjAD&url=http%3A%2F%2Fwww.cs.colostate.edu%2F~massey%2FTeaching%2Fcs301%2FRestrictedAccess%2FSlides%2F301lecture23.pdf&ei=6qelT4KMA6SA0AXIu7CQBA&usg=AFQjCNG3fc1mD7g5f-14vfDPdvyX2uScDg
| title = Recursive and Recursively Enumerable Languages
| accessdate = 2012-05-05
}}</ref>
show that languages exist which can not be described by any set of rules.
==References==
==References==