Normal forms under Simon's congruence

DOI10.1007/S00233-017-9910-5zbMath1429.68204OpenAlexW2772445731MaRDI QIDQ667852

Péter Pál Pach

Publication date: 1 March 2019

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/74630/1/simon1106.pdf

zbMATH Keywords

normal formcombinatorics on wordspiecewise testable languages

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Unnamed Item ⋮ Nearly \(k\)-universal words -- investigating a part of Simon's congruence ⋮ Nearly \(k\)-universal words -- investigating a part of Simon's congruence

Cites Work

• Unnamed Item
• Unnamed Item
• On the word problem for syntactic monoids of piecewise testable languages.
• Piecewise testable languages via combinatorics on words
• Equations and monoid varieties of dot-depth one and two
• Games, equations and the dot-depth hierarchy
• On the index of Simon's congruence for piecewise testability

This page was built for publication: Normal forms under Simon's congruence