On quasi-universal word functions

DOI10.3103/S0278641916010040zbMATH Open1339.03032MaRDI QIDQ290002FDOQ290002

Authors: K. V. Osipov 

Publication date: 1 June 2016

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Recommendations

• On universal partial words
• On universal partial words
• ON UNIVERSAL FUNCTIONS
• On universal functions
• Universal partial words over non-binary alphabets
• On elementary word functions obtained by bounded prefix concatenation
• On the universal functions
• Recursive Word‐Functions over Infinite Alphabets
• A Mahler's Theorem for Word Functions
• Synthesis of computable regular functions of infinite words

zbMATH Keywords

quasi-universal functionword functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• 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
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
• Title not available (Why is that?)

Cited In (4)

• Operation of bound prefix concatenation and finite superposition bases
• On elementary word functions obtained by bounded prefix concatenation
• Title not available (Why is that?)
• On the operations of bounded suffix summation and multiplication

This page was built for publication: On quasi-universal word functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290002)