Pages that link to "Item:Q1647686"
From MaRDI portal
The following pages link to Descriptional and computational complexity of the circuit representation of finite automata (Q1647686):
Displaying 6 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Descriptional Complexity of Operations on Alternating and Boolean Automata (Q2907501) (← links)
- (Q3517106) (← links)
- (Q5145160) (← links)
- Effective theories for circuits and automata (Q5264344) (← links)