Finite dP Automata versus Multi-head Finite Automata (Q2890286): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the computational complexity of P automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P Automata: Concepts, Results, and New Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of multi-head finite automata: origins and directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: P and dP Automata: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite hierarchy of languages defined by dP systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3406469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Latest revision as of 08:23, 5 July 2024

scientific article
Language Label Description Also known as
English
Finite dP Automata versus Multi-head Finite Automata
scientific article

    Statements