Primitivity, uniform minimality, and state complexity of Boolean operations
From MaRDI portal
Publication:2322701
DOI10.1007/s00224-018-9859-0zbMath1430.68142arXiv1702.00877MaRDI QIDQ2322701
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00877
finite automaton; state complexity; primitive group; Boolean operation; uniformly minimal; transition monoid
68Q45: Formal languages and automata
Uses Software