期刊
THEORETICAL COMPUTER SCIENCE
卷 409, 期 3, 页码 537-548出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2008.09.031
关键词
Rational; Recognizable; Rewriting systems; Reversibility
资金
- F.C.T. [POCTI/MAT/37670/2001]
- POCTI
- POSI
- national and European Community structural funds
- Fundação para a Ciência e a Tecnologia [POCTI/MAT/37670/2001] Funding Source: FCT
A class of monoids that can model partial reversibility allowing simultaneously instances of two-sided reversibility, one-sided reversibility and no reversibility is considered. Some of the basic decidability problems involving their rational subsets, syntactic congruences and characterization of recognizability. are solved using purely automata-theoretic techniques, giving further insight into the structure of recognizable languages. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据