Pages that link to "Item:Q5551469"
From MaRDI portal
The following pages link to Counter machines and counter languages (Q5551469):
Displayed 50 items.
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Three small universal spiking neural P systems (Q487986) (← links)
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- On the computational complexity of spiking neural P systems (Q609034) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Simple programming languages and restricted classes of Turing machines (Q792760) (← links)
- Remarks on two-way automata with weak-counters (Q793509) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- 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)