Piecewise testable languages via combinatorics on words

DOI10.1016/j.disc.2011.06.013zbMath1227.68086OpenAlexW1994423236MaRDI QIDQ641179

Ondřej Klíma

Publication date: 21 October 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.013

zbMATH Keywords

piecewise testable languagessyntactic congruence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Related Items

On Boolean combinations forming piecewise testable languages ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Normal forms under Simon's congruence ⋮ AROUND DOT-DEPTH ONE ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of some classes of regular events
• Partially ordered finite monoids and a theorem of I. Simon
• A proof of Simon's theorem on piecewise testable languages
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon

This page was built for publication: Piecewise testable languages via combinatorics on words