Biautomata for k-Piecewise Testable Languages

DOI10.1007/978-3-642-31653-1_31zbMath1370.68181OpenAlexW62349956MaRDI QIDQ3167508

Libor Polák, Ondřej Klíma

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_31

zbMATH Keywords

biautomata\(\mathcal J\)-trivial monoids\(k\)-piecewise testable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Obituary: Libor Polák (1950--2020) ⋮ On linear languages recognized by deterministic biautomata

This page was built for publication: Biautomata for k-Piecewise Testable Languages