| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429114 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We give a counterexample to the conjecture which was originally formulated by Straubing in 1986 concerning a certain algebraic characterization of regular languages of level 2 in the Straubing–Thérien concatenation hierarchy of star-free languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
