Pages that link to "Item:Q1771314"
From MaRDI portal
The following pages link to Complete classifications for the communication complexity of regular languages (Q1771314):
Displayed 8 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
- On the Non-deterministic Communication Complexity of Regular Languages (Q3533002) (← links)
- WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY (Q3561125) (← links)
- ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES (Q3586400) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- (Q5002813) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)