The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (Q3004573): 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 | The Parameterized Complexity of Chosen Problems for Finite Automata on Trees |
scientific article |
Statements
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (English)
0 references
3 June 2011
0 references