Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.tcs.2008.09.031 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
recognizable,Reversibility,Rational,Recognizable,automata-theoretic technique,Rewriting systems,partial reversibility,recognizable language,rewriting systems,basic decidability problem,two-sided reversibility,reversibility,rational,rational subsets,one-sided reversibility,syntactic congruence,reversible monoids | Journal | 409 |
Issue | ISSN | Citations |
3 | Theoretical Computer Science | 3 |
PageRank | References | Authors |
0.73 | 10 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |