6 structure of CFLs.pdf

6 structure of CFLs.pdf

ID:33939716

大小:1.22 MB

页数:41页

时间:2019-03-01

6 structure of CFLs.pdf_第1页
6 structure of CFLs.pdf_第2页
6 structure of CFLs.pdf_第3页
6 structure of CFLs.pdf_第4页
6 structure of CFLs.pdf_第5页
资源描述:

《6 structure of CFLs.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、6StructureofCFLs6.1IntroductionWhatcanbetheadditionstoafiniteautomatonsothatitmayacceptanycontext-freelanguage?Clearly,someadditionisrequiredaseachregularlanguageiscontext-freeandtherearecontext-freelanguagesthatarenotregular.Forexample,thelan-guageL={anbn:

2、n∈N}iscontext-freebutitisnotregular.Hereyoucanseethatsomehowtheautomatonmustrememberhowmanya’sithasread,andthenithastoconsumeb’soneafteranothermatchingtothatnumber.Afiniteautomatondoesnotrememberanything.So,wedonotseehowanautomatoncanacceptthelanguage{ww:w∈

3、{a,b}∗},wherewisthestringobtainedfromwbyinterchanginga’swithb’s.Weaddsomesortofmemorytoafiniteautomatonsothatitremembersthefirsthalfandthenmatchthatwiththesecondhalf,symbolbysymbol.Moreover,howwoulditknowthatithascomeacrossthefirsthalfoftheinputstring?Well,we

4、willkeepthatundeterminedsothattheautomatonwouldguessandthenwilldotherightthingwhenithastherightguess.Ifitisnottherightguess,thenthemachinewillnotbepenalizedforit.Anondeterministicmachinewithsomekindofmemorymightdothejob.6.2PushdownAutomataWestartwithsuchan

5、ondeterministicmachinewithaveryprimitivetypeofmemory,calledastackorapushdownstorage.Astackresembleskeepingbooksonyourtable,whereyoucanaddonemoreonthetoportakeoutonefromthetop.Weplantoaddsuchastacktoafiniteautomaton.Thesetwooperationsofaddingonemoreonthetop,

6、calledpushingtothestack,anddeletingonefromthetop,calledpoppingofffromthestack,areinbuilttoanystack.Toseehowthelanguage{anbn:n∈N}canbeacceptedbyanautomatonwithastack,thinkofanautomatonthataccepts{ambn:m,n∈N}andthengiveitthecapabilityofputtingonepebbleonthes

7、tackwhenanaisreadandthrowingonepebbleoutwhenabisread.So,thestackmustbeemptybeforetheautomatonstartsA.Singh,ElementsofComputationTheory,TextsinComputerScience,159cSpringer-VerlagLondonLimited20091606StructureofCFLsanditmustalsobeemptyattheendofitsworkforac

8、ceptingthestring.Thisstackalongwithafiniteautomatonfora∗b∗willaccept{ambm:m∈N}.Suchamachinehasafiniteinputtapecontainingitsinput.Thereadingheadreadsfromlefttorightonesymbolatatime,orevenitreadsnothingsometimes.

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。