Article: Study data from University of Porto update knowledge of algebra and computation.

"This paper studies rr-, lr-, rl-, and ll-automatic structures for finitely generated submonoids of monoids presented by confluent rewriting system that are either finite and special or regular and monadic. A new technique is developed that uses an automaton to ''translate'' between words in the original rewriting system and words over the generators for the submonoid," researchers in Oporto, Portugal report.

"This is applied to show that the submonoid inherits any notion of automatism possessed by the original monoid. Generalizations of results of Otto and Ruskuc are thus obtained: every finitely generated submonoid of a monoid presented by a confluent finite ...

Related newspaper, magazine, and journal articles:

 
 
Newsweek Harper's Magazine The Washington Post Chicago Tribune Crain's Chicago Business PRNewswire Pediatric News The Nation Advertising Age The Economist (US) A FREE trial gives you access to over 80 million articles! Access over 6,500 publications with a FREE trial!