Undecidability of the State Complexity of Composed Regular Operations (Q3004607): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability of the State Complexity of Composed Regular Operations |
scientific article |
Statements
Undecidability of the State Complexity of Composed Regular Operations (English)
0 references
3 June 2011
0 references
finite deterministic automaton
0 references
state complexity
0 references
undecidability
0 references
regularity-preserving operations
0 references
composition of operations
0 references
