Probabilistic tree automata and context free languages (Q2542994): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4991691 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292904 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5583072 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02798680 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071902050 / rank | |||
Normal rank |
Latest revision as of 11:22, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probabilistic tree automata and context free languages |
scientific article |
Statements
Probabilistic tree automata and context free languages (English)
0 references
1970
0 references
0 references
0 references