On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages

DOI10.1007/978-3-642-39310-5_14zbMath1388.68141arXiv1304.0733OpenAlexW150037375MaRDI QIDQ2843091

Tomáš Masopust, Galina Jirásková

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0733

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

On Boolean combinations forming piecewise testable languages

This page was built for publication: On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages