Pages that link to "Item:Q5551469"
From MaRDI portal
The following pages link to Counter machines and counter languages (Q5551469):
Displayed 50 items.
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Two-way automata with more than one storage medium (Q1083206) (← links)
- One-way weak-stack-counter automata (Q1137874) (← links)
- Indirect addressing and the time relationships of some models of sequential computation (Q1140427) (← links)
- On-line n-bounded multicounter automata (Q1143795) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- On the pre-AFL of \([lg\;n]\) space and related families of languages (Q1231780) (← links)
- The LBA-problem and the deterministic tape complexity of two-way one- counter languages over a one-letter alphabet (Q1239007) (← links)
- Computational complexity of multitape Turing machines and random access machines (Q1249434) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Counter machines (Q1606993) (← links)
- Counter machines and distributed automata -- a story about exchanging space and time (Q1656682) (← links)
- Computations on register machines with counters (Q1744355) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Clocked population protocols (Q2040025) (← links)
- Minimum-cost delegation in service composition (Q2378522) (← links)
- On some derivation mechanisms and the complexity of their Szilard languages (Q2453536) (← links)
- Time-restricted sequence generation (Q2537897) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- Translating recursion equations into flow charts (Q2553232) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Universality in Infinite Petri Nets (Q2945886) (← links)
- Homing vector automata (Q2969985) (← links)
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS (Q3056282) (← links)
- SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES (Q3086246) (← links)
- On the Complexity of Szilard Languages of Regulated Grammars (Q3105746) (← links)
- On the Computational Complexity of Spiking Neural P Systems (Q3543343) (← links)
- Simulations by Time-Bounded Counter Machines (Q3637243) (← links)
- (Q3657451) (← links)
- On two-way weak counter machines (Q3766856) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- (Q3873564) (← links)
- Equivalence problem for finitely iterated counter machines (Q3910027) (← links)
- Non-prinicipalité du cylindre des langages à compteur (Q4121409) (← links)