Hierarchies of piecewise testable languages

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

KLÍMA Ondřej POLÁK Libor

Year of publication 2007
Type Appeared in Conference without Proceedings
MU Faculty or unit

Faculty of Science

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:

You are running an old browser version. We recommend updating your browser to its latest version.