On simple generators of recursively enumerable languages

作者：

Highlights：

• Polynomial generators for recursively enumerable languages.

• The languages REP={(amb)n|m,n∈N} and BREP={(anb)n|n∈N} possess a catenation closure property.

• Applying classical number theory results in formal languages.

摘要

•Polynomial generators for recursively enumerable languages.•The languages REP={(amb)n|m,n∈N} and BREP={(anb)n|n∈N} possess a catenation closure property.•Applying classical number theory results in formal languages.

论文关键词：Intersection-closed trio,R.e. language,Diophantine equation

论文评审过程：Received 29 April 2014, Accepted 29 May 2014, Available online 23 June 2014.

论文官网地址：https://doi.org/10.1016/j.jcss.2014.05.002