On simple generators of recursively enumerable languages

DOI10.1016/j.jcss.2014.05.002zbMath1298.68144OpenAlexW1999654795MaRDI QIDQ743126

Juha Kortelainen

Publication date: 22 September 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.05.002

zbMATH Keywords

Diophantine equationintersection-closed trior.e. language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quadratic and bilinear Diophantine equations (11D09) Higher degree equations; Fermat's equation (11D41)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some bounded semiAFLs and AFLs
• Modular elliptic curves and Fermat's Last Theorem
• What makes some language theory problems undecidable
• The Hardest Context-Free Language
• Developments in Language Theory
• Intersection-closed full AFL and the recursively enumerable languages

This page was built for publication: On simple generators of recursively enumerable languages