Abstract
The notion of a program over a finite semigroup has recently emerged from the work of D.A. Barrington on bounded-width branching programs [2], [3], and the joint work of D.A. Barrington and D. Therien [4], [5]. These authors introduced programs over semigroups under the name of “non-uniform deterministic finite automata (NUDFA)”, and they studied the potential programs have in terms of recognizability of certain languages that are commonly treated in complexity theory by using families of Boolean circuits.
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.
