{"title":"只有一个对象的类别中的产品","authors":"R. Statman","doi":"10.4204/EPTCS.333.24","DOIUrl":null,"url":null,"abstract":"We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us to solve problems such as (1) Given a finite set B of elements and an element F, is F a product of members of B? (2) Is the submonoid generated by the finite set B infinite? for certain fragments of the free Cartesian monoid. These fragments include the submonoid of right invertible elements and so our results apply to the Thompson-Higman groups.","PeriodicalId":11810,"journal":{"name":"essentia law Merchant Shipping Act 1995","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Products in a Category with Only One Object\",\"authors\":\"R. Statman\",\"doi\":\"10.4204/EPTCS.333.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us to solve problems such as (1) Given a finite set B of elements and an element F, is F a product of members of B? (2) Is the submonoid generated by the finite set B infinite? for certain fragments of the free Cartesian monoid. These fragments include the submonoid of right invertible elements and so our results apply to the Thompson-Higman groups.\",\"PeriodicalId\":11810,\"journal\":{\"name\":\"essentia law Merchant Shipping Act 1995\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"essentia law Merchant Shipping Act 1995\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.333.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"essentia law Merchant Shipping Act 1995","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.333.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us to solve problems such as (1) Given a finite set B of elements and an element F, is F a product of members of B? (2) Is the submonoid generated by the finite set B infinite? for certain fragments of the free Cartesian monoid. These fragments include the submonoid of right invertible elements and so our results apply to the Thompson-Higman groups.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
