Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fundamentals of Computation Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simplifying XML schema: single-type approximations of regular tree languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deciding top-down determinism of regular tree languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3086931 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal Ascending and Descending Tree Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3902489 / rank | |||
Normal rank | |||
Latest revision as of 17:27, 28 August 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
