Skip to main content
SpringerLink
Log in

Deterministic Concatenation Product of Languages Recognized by Finite Idempotent Monoids

  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

We give explicit descriptions of varieties of finite monoids as well as of varieties of finite ordered monoids corresponding to the left deterministic, right deterministic and bideterministic products of languages recognized by finite idempotent monoids.

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

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centro de Algebra da Universidade de Lisboa Av. Prof. Gama Pinto, 2 1649-003 and Departamento de Matematica Faculdade de Ciencias da Universidade de Lisboa, Campo Grande Edificio C6 Piso 2 1749-016 , Lisboa, Portugal

    Mario J.J. Branco

Authors
  1. Mario J.J. Branco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mario J.J. Branco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Branco, M. Deterministic Concatenation Product of Languages Recognized by Finite Idempotent Monoids. Semigroup Forum 74, 379–409 (2007). https://doi.org/10.1007/s00233-006-0669-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00233-006-0669-3

Keywords

Search

Navigation