Descriptional and computational complexity of the circuit representation of finite automata (Q1647686)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Descriptional and computational complexity of the circuit representation of finite automata |
scientific article; zbMATH DE number 6894743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Descriptional and computational complexity of the circuit representation of finite automata |
scientific article; zbMATH DE number 6894743 |
Statements
Descriptional and computational complexity of the circuit representation of finite automata (English)
0 references
26 June 2018
0 references
