Rational subsets of partially reversible monoids

Authors:
Pedro V. Silva
Affiliations:
Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre 687, 4169-007 Porto, Portugal
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 1

The equivalence and inclusion problems for NTS languages

Journal of Computer and System Sciences
Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction

on Rewriting techniques and applications
Some decision problems about controlled rewriting systems

Theoretical Computer Science
String-rewriting systems

String-rewriting systems
A polynomial algorithm testing partial confluence of basic semi-Thue systems

Theoretical Computer Science - Special issue: rewriting systems and applications
Regularity and Related Problems for Deterministic Pushdown Automata

Journal of the ACM (JACM)
L(A) = L(B)? decidability results from complete formal systems

Theoretical Computer Science

Groups and automata: a perfect match

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	5.23

Visualization

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.