On Upper and Lower Bounds on the Length of Alternating Towers
From MaRDI portal
Publication:2922026
DOI10.1007/978-3-662-44522-8_27zbMath1425.68205arXiv1404.4495OpenAlexW197394137MaRDI QIDQ2922026
Tomáš Masopust, Galina Jirásková, Štěpán Holub
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.4495
Related Items (1)
Cites Work
- Unnamed Item
- Characterizations of some classes of regular events
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages
- The pseudovariety $J$ is hyperdecidable
- Separating regular languages with first-order logic
- Efficient Separability of Regular Languages by Subsequences and Suffixes
- On the State Complexity of Closures and Interiors of Regular Languages with Subwords
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: On Upper and Lower Bounds on the Length of Alternating Towers