Pages that link to "Item:Q2944881"

The following pages link to Aspects of Reversibility for Classical Automata (Q2944881):

Displaying 20 items.

• Reversible top-down syntax analysis (Q832945) (← links)
• Reversible parallel communicating finite automata systems (Q2041681) (← links)
• An instruction set for reversible Turing machines (Q2041688) (← links)
• Energy complexity of regular language recognition (Q2164753) (← links)
• Minimal and Reduced Reversible Automata (Q2829980) (← links)
• The Degree of Irreversibility in Deterministic Finite Automata (Q2830203) (← links)
• Reversible Limited Automata (Q2945882) (← links)
• Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
• When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
• Boosting Reversible Pushdown Machines by Preprocessing (Q3186586) (← links)
• The Degree of Irreversibility in Deterministic Finite Automata (Q4605511) (← links)
• Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
• (Q5016363) (← links)
• Queue Automata: Foundations and Developments (Q5112182) (← links)
• Concise Representations of Reversible Automata (Q5205047) (← links)
• Boosting Reversible Pushdown and Queue Machines by Preprocessing (Q5859661) (← links)
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)
• Reversible Top-Down Syntax Analysis (Q6169965) (← links)
• Energy complexity of regular languages (Q6199407) (← links)
• Reversible Two-Party Computations (Q6204131) (← links)