首页> 外文期刊>Journal of logic and computation >Classifying all transducer degrees below N~3
【24h】

Classifying all transducer degrees below N~3

机译:Classifying all transducer degrees below N~3

获取原文
获取原文并翻译 | 示例
           

摘要

We answer an open question in the theory of transducer degrees initially posed in Endrullis et al. (2016, Proc. Conf. on Developments in Language Theory (DLT 2016), 164–176), on the structure of polynomial transducer degrees. Transducer degrees are the equivalence classes formed by word transformations which can be realized by a finite-state transducer (FST). While there are no general techniques to tell if a wordσ can be transformed intoτ via an FST, the work of Endrullis et al. (2010, J. Int., 11B.A6, 164–176) provides a test for the class of streams determined by spiralling functions, which includes all streams determined by polynomials. We fully classify the degrees of all cubic polynomial streams which are below the stream corresponding to n3, and many of the methods can also be used to classify the degrees of polynomial streams of higher orders.

著录项

  • 来源
    《Journal of logic and computation》 |2023年第5期|970-983|共14页
  • 作者

    NOAH KAUFMANN;

  • 作者单位

    Mathematics Department, Indiana University, Bloomington Indiana, USA;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号