Bounded prefix concatenation operation and finite bases with respect to the superposition

DOI10.1515/dma-2017-0031zbMath1390.68409OpenAlexW2761481111MaRDI QIDQ1744291

Sergey S. Marchenkov

Publication date: 23 April 2018

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0031

zbMATH Keywords

finite basis with respect to the superpositionoperation of bounded prefix concatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On elementary word functions obtained by bounded prefix concatenation
• A superposition basis in the class of Kalmar elementary functions
• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• An example of a simple quasi-universal function in the class ε 2 of the Grzegorczyk hierarchy
• Hierarchies of Primitive Recursive Functions
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded prefix concatenation operation and finite bases with respect to the superposition