On elementary word functions obtained by bounded prefix concatenation

DOI10.1515/DMA-2016-0013zbMATH OpenNoneOpenAlexW2486895637MaRDI QIDQ314213FDOQ314213

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

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

zbMATH Keywords

bounded prefix concatenationpolynomially computable function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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)