AbstractWe prove that for special Thue systems T either all congruence classes are regular languages or none of them are. If all classes are regular languages, all syntactical congruences defined by the congruence classes modulo T are equal to the congruence defined by T
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
AbstractA finite string-rewriting system R preserves regularity if and only if it preserves Σ-regula...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractWe prove that for special Thue systems T either all congruence classes are regular languages...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
AbstractLet A∗ be the free monoid of base A and n a fixed positive integer. For any word wϵA∗ we con...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
AbstractA finite string-rewriting system R preserves regularity if and only if it preserves Σ-regula...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractWe prove that for special Thue systems T either all congruence classes are regular languages...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
© 2015 ACM 0004-5411/2015/10-ART32 15.00. This article shows a general result about finite monoids a...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
International audienceWe present a collection of results on regular tree languages and rewrite syste...
AbstractLet A∗ be the free monoid of base A and n a fixed positive integer. For any word wϵA∗ we con...
AbstractCertain infinite Thue systems over a finite alphabet are studied, in particular, systems S⊆∑...
AbstractA finite string-rewriting system R preserves regularity if and only if it preserves Σ-regula...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...