Pages that link to "Item:Q1219160"
From MaRDI portal
The following pages link to Reversal-bounded multipushdown machines (Q1219160):
Displaying 50 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Similarity in languages and programs (Q391201) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- Undecidability in matrices over Laurent polynomials. (Q705234) (← links)
- On the universe, disjointness, and containment problems for simple machines (Q710740) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- On a class of languages with holonomic generating functions (Q728269) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Decision problems for language equations (Q972384) (← links)
- A note on bounded-reversal multipushdown machines (Q1057071) (← links)
- A characterization of reversal-bounded multipushdown machine languages (Q1058865) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs (Q1094877) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- On reversal bounded alternating Turing machines (Q1102114) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- Cônes rationnels commutatifs (Q1133330) (← links)
- Recursivite et cônes rationnels fermés par intersection (Q1133331) (← links)
- Simple counter machines and number-theoretic problems (Q1136223) (← links)
- Reset machines (Q1136756) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Independance forte de certaines opérations (Q1151759) (← links)
- Petri nets and regular languages (Q1158763) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- On characterizations of recursively enumerable languages (Q1262786) (← links)
- On representing recursively enumerable languages by internal contextual languages (Q1275069) (← links)
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction (Q1390864) (← links)
- Closure and decidability properties of some language classes with respect to ciliate bio-operations. (Q1426436) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Homomorphic characterizations of recursively enumerable languages with very small language classes (Q1589418) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- On some bounded semiAFLs and AFLs (Q1837538) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
