Rational subsets of partially reversible monoids

DOI10.1016/j.tcs.2008.09.031zbMath1155.68047OpenAlexW2008821042MaRDI QIDQ2378535

Pedro V. Silva

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.031

zbMATH Keywords

reversibilityrewriting systemsrationalrecognizable

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Fixed points of endomorphisms of certain free products ⋮ Fixed points of endomorphisms over special confluent rewriting systems. ⋮ INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some decision problems about controlled rewriting systems
• The equivalence and inclusion problems for NTS languages
• A polynomial algorithm testing partial confluence of basic semi-Thue systems
• \(L(A)=L(B)\)? decidability results from complete formal systems
• On the rational subsets of the free group
• Regularity and Related Problems for Deterministic Pushdown Automata
• Free group languages: Rational versus recognizable

This page was built for publication: Rational subsets of partially reversible monoids