Pages that link to "Item:Q1151753"
From MaRDI portal
The following pages link to The complexity of decision problems for finite-turn multicounter machines (Q1151753):
Displaying 50 items.
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- Static analysis of XML security views and query rewriting (Q462481) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- Pushdown automata with reversal-bounded counters (Q1112611) (← links)
- Deciding freeness for program schemes with a single unary function (Q1159977) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- Finite-valued distance automata (Q1341750) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Sequential grammars and automata with valences (Q1605318) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Some decision problems concerning semilinearity and commutation. (Q1872706) (← links)
- On two-way FA with monotonic counters and quadratic Diophantine equations (Q1884954) (← links)
- On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)
- On decidability and closure properties of language classes with respect to bio-operations (Q2311220) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Deletion operations on deterministic families of automata (Q2407104) (← links)
- On store languages and applications (Q2417850) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- Insertion operations on deterministic reversal-bounded counter machines (Q2424688) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS (Q3021995) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- On two-way weak counter machines (Q3766856) (← links)
- A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
- INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis (Q4652794) (← links)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (Q4923281) (← links)
- (Q5005148) (← links)
- (Q5013881) (← links)
- (Q5089200) (← links)
- (Q5090448) (← links)
- Input-Position-Restricted Models of Language Acceptors (Q5112180) (← links)
