Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054116500246 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2551941547 / rank | |||
Normal rank | |||
Latest revision as of 09:35, 30 July 2024
scientific article; zbMATH DE number 6663534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Operational State Complexity of Subtree-Free Regular Tree Languages |
scientific article; zbMATH DE number 6663534 |
Statements
Operational State Complexity of Subtree-Free Regular Tree Languages (English)
0 references
14 December 2016
0 references
deterministic ranked tree automata
0 references
state complexity
0 references
subtree-free regular tree languages
0 references
0 references
0 references
