Programs over Finite Semigroups: An Introduction

Gerard Lallement
Additional contact information
Gerard Lallement: The Pennsylvania State University, Department of Mathematics

A chapter in Lattices, Semigroups, and Universal Algebra, 1990, pp 163-172 from Springer

Abstract: 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. Thérien [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.

Keywords: Boolean Function; Semi Group; Finite Semigroup; Polynomial Size; Boolean Circuit (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4899-2608-1_18

Ordering information: This item can be ordered from
http://www.springer.com/9781489926081

DOI: 10.1007/978-1-4899-2608-1_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().