One-way reversible multi-head finite automata (Q2358688): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.11.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2553644099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / 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: On the Succinctness of Different Representations of Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way multihead deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast reversible language recognition using cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time reversible iterative arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Reversible One-Way Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Head and state hierarchies for unary multi-head finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversibility and Heat Generation in the Computing Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible computing and cellular automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Reversible Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversing algebraic process calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way multihead writing finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i> + 1 Heads Are Better than <i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Flowchart Languages and the Structured Reversible Program Theorem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.11.006 / rank
 
Normal rank

Latest revision as of 04:51, 18 December 2024

scientific article
Language Label Description Also known as
English
One-way reversible multi-head finite automata
scientific article

    Statements

    One-way reversible multi-head finite automata (English)
    0 references
    0 references
    0 references
    15 June 2017
    0 references
    one-way multi-head finite automata
    0 references
    reversible computations
    0 references
    decidability questions
    0 references

    Identifiers