Show simple item record

dc.contributor.authorBrzozowski, Janusz
dc.contributor.authorLi, Baiyu
dc.date.accessioned2017-09-29 14:03:07 (GMT)
dc.date.available2017-09-29 14:03:07 (GMT)
dc.date.issued2014-11-01
dc.identifier.urihttp://dx.doi.org/10.1142/S0129054114400097
dc.identifier.urihttp://hdl.handle.net/10012/12509
dc.descriptionElectronic version of an article published as International Journal of Foundations of Computer Science, 25(07), 2014, 807–821. http://dx.doi.org/10.1142/S0129054114400097 © World Scientific Publishing Company http://www.worldscientific.com/en
dc.description.abstractThe syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We prove that n! and [e(n - 1)!] are tight upper bounds for the syntactic complexity of R- and J-trivial regular languages, respectively.en
dc.description.sponsorshipNatural Sciences and Engineering Research Council of Canada [OGP0000871]en
dc.language.isoenen
dc.publisherWorld Scientific Publishingen
dc.subjectFinite automatonen
dc.subjectJ-trivialen
dc.subjectmonoiden
dc.subjectregular languageen
dc.subjectR-trivialen
dc.subjectsemigroupen
dc.subjectsyntactic complexityen
dc.titleSyntactic Complexity Of R- And J-Trivial Regular Languagesen
dc.typeArticleen
dcterms.bibliographicCitationBrzozowski, J., & Li, B. (2014). SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES. International Journal of Foundations of Computer Science, 25(07), 807–821. https://doi.org/10.1142/S0129054114400097en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2David R. Cheriton School of Computer Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages