Publication details
Hierarchies of piecewise testable languages
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Appeared in Conference without Proceedings |
| MU Faculty or unit | |
| Citation | |
| Description | The topic of the talk is an algebraic language theory. It is well known that a language is piecewise testable if and only if its syntactic monoid is finite and J-trivial. We describe several classes of piecewise testable languages and we give characteristic properties of their syntactic structures. |
| Related projects: |