Abstract
Abstract The paper is concerned with word functions over the alphabet {1,2}. Given arbitrary one-place functions f 1, …, f l , the class BPC[f 1, …, f l ] is defined as the closure of the set of simplest word functions and the functions f 1, …, f l under the operations of superposition and bounded prefix concatenation. The class BPC[f 1, …, f l ] is shown to have a finite basis with respect to the superposition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
