On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715)
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: On the descriptional complexity of finite automata with modified acceptance conditions |
scientific article; zbMATH DE number 2136575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the descriptional complexity of finite automata with modified acceptance conditions |
scientific article; zbMATH DE number 2136575 |
Statements
On the descriptional complexity of finite automata with modified acceptance conditions (English)
0 references
22 February 2005
0 references
Finite automata
0 references
Acceptance conditions
0 references
Computational power
0 references
Descriptional complexity
0 references
0 references
