Skip to main content
SpringerLink
Log in

Languages recognized by programs over the two-element monoid

  • Short Note
  • Published:
Semigroup Forum Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. D.A. Barrington and D. Thérien,Finite monoids and the fine structure of NC1. Proc. 19th ACM STOC. 1987. 101–109.

  2. D.A. Barrington and D. Thérien.Non-uniform automata over groups, Proc. 14th ICALP, 1987, 163–173.

  3. R. Smolensky,Algebraic methods in the theory of lower bounds for boolean circuit complexity, Proc. 19th ACM STOC, 1987.

  4. D. Thérien,Programs over aperiodic monoids, preprint.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Pennsylvania State University, 16802, University Park, PA, USA

    Gerard Lallement

Authors
  1. Gerard Lallement
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by N. Reilly

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lallement, G. Languages recognized by programs over the two-element monoid. Semigroup Forum 38, 371–374 (1989). https://doi.org/10.1007/BF02573245

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02573245

Keywords

Search

Navigation