Hierarchies of piecewise testable languages

Warning

This publication doesn't include Institute of Computer Science. 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:	Mathematical structures and their physical applications Algebraic Methods in Automata and Formal Language Theory