Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4387167325 / rank | |||
Normal rank | |||
Revision as of 09:47, 30 July 2024
scientific article; zbMATH DE number 7824709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking in polynomial time whether or not a regular tree language is deterministic top-down |
scientific article; zbMATH DE number 7824709 |
Statements
Checking in polynomial time whether or not a regular tree language is deterministic top-down (English)
0 references
26 March 2024
0 references
automata
0 references
trees
0 references
deterministic top-down
0 references
