The finite power property in free groups

DOI10.1016/S0304-3975(02)00232-3zbMATH Open1025.68049MaRDI QIDQ1870586FDOQ1870586

Flavio D'Alessandro, Jacques Sakarovitch

Publication date: 14 May 2003

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

zbMATH Keywords

formal languagesfree groupdistance automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Limitedness theorem on finite automata with distance functions
• Improved limitedness theorems on finite automata with distance functions
• On a Theorem of R. Jungen
• Some results on the dot-depth hierarchy
• Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
• On the complexity of some extended word problems defined by cancellation rules
• The dot-depth hierarchy of star-free languages is infinite
• The finite power property for context-free languages

Cited In (3)

• THE GROUP OF TRANSLATIONS AND POSITIVE RATIONAL POWERS IS FREE
• Representing hyper-arithmetical sets by equations over sets of integers
• Title not available (Why is that?)

This page was built for publication: The finite power property in free groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870586)