Symmetric Groups and Quotient Complexity of Boolean Operations

DOI10.1007/978-3-662-43951-7_1zbMath1409.68151arXiv1310.1841OpenAlexW1492009014MaRDI QIDQ5167822

Rogério Reis, Nelma Moreira, Janusz A. Brzozowski, Jason P. Bell

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

zbMATH Keywords

symmetric groupregular languagetransition semigroupstate complexityBoolean operationquotient complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Symmetric groups (20B30)

Related Items (4)

Complexity of suffix-free regular languages ⋮ Most Complex Non-Returning Regular Languages ⋮ Unrestricted State Complexity of Binary Operations on Regular Languages ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations

This page was built for publication: Symmetric Groups and Quotient Complexity of Boolean Operations