Journal
THEORETICAL COMPUTER SCIENCE
Volume 409, Issue 3, Pages 537-548Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2008.09.031
Keywords
Rational; Recognizable; Rewriting systems; Reversibility
Categories
Funding
- 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
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
