Probabilistic tree automata and context free languages (Q2542994): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:31, 12 June 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