Finite J-Trivial Monoids and Partially Ordered Monoids

Howard Straubing and Denis Thérien
Additional contact information
Howard Straubing: Boston College, Department of Computer Science
Denis Thérien: McGill University, School of Computer Science

A chapter in Semigroups and Their Applications, 1987, pp 183-189 from Springer

Abstract: Abstract An important result in the theory of automata, due to Imre Simon, characterizes the recognizable languages whose syntactic monoids are J-trivial. This theorem has an easy, although not entirely obvious, restatement as a global structure theorem for finite J-trivial monoids, asserting that every finite J-trivial monoid is a quotient of a finite monoid admitting a partial order compatible with the multiplication and having 1 as the maximum element. We have proved the theorem in this form using semigroup expansion techniques. In the present note we discuss the background and significance of this work and give a brief sketch of our proof. The full details of the proof will appear elsewhere [ST].

Date: 1987
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-94-009-3839-7_21

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

DOI: 10.1007/978-94-009-3839-7_21

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 ().