State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach
From MaRDI portal
Publication:5298308
DOI10.1142/S0129054116500234zbMath1351.68137arXiv1505.03474OpenAlexW2964037500MaRDI QIDQ5298308
Bruno Patrou, Pascal Caron, Ludovic Mignot, Jean-Gabriel Luque
Publication date: 14 December 2016
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03474
Related Items
A Study of a Simple Class of Modifiers: Product Modifiers ⋮ Operational state complexity revisited: the contribution of monsters and modifiers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
Cites Work
- State complexity of basic language operations combined with reversal
- Intersection and union of regular languages and state complexity
- The state complexities of some basic operations on regular languages
- State complexity of some operations on binary regular languages
- State complexity of combined operations
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
- IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Derivatives of Regular Expressions
