Probabilistic length-reducing two-pushdown automata (Q841617): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-007-9066-x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Growing context-sensitive languages and Church-Rosser languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas II: Two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership for growing context-sensitive grammars is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound technique for length-reducing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Length-Reducing Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of probabilistic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser Thue systems and formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418659 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-007-9066-X / rank
 
Normal rank

Latest revision as of 04:53, 10 December 2024

scientific article
Language Label Description Also known as
English
Probabilistic length-reducing two-pushdown automata
scientific article

    Statements

    Identifiers