On elementary word functions obtained by bounded prefix concatenation

DOI10.1515/DMA-2016-0013MaRDI QIDQ314213zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 13 September 2016

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

Full work available at URL https://doi.org/10.1515/dma-2016-0013

zbMATH Keywords

bounded prefix concatenationpolynomially computable function

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Bounded prefix concatenation operation and finite bases with respect to the superposition
• On the operations of bounded suffix summation and multiplication
• On quasi-universal word functions
• Bounded monotone recursion and multihead automata
• scientific article; zbMATH DE number 3995650

Cited in

(7)

• Canonical forms for interval functions
• Bounded prefix concatenation operation and finite bases with respect to the superposition
• Bounded monotone recursion and multihead automata
• On quasi-universal word functions
• On the operations of bounded suffix summation and multiplication
• Operation of bound prefix concatenation and finite superposition bases
• On the coincidence of complexity classes BPC and \(\text{TC}^0 \)

This page was built for publication: On elementary word functions obtained by bounded prefix concatenation

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