About: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Documentation

scienceplus.abes.fr version Bêta

scienceplus.abes.fr | explorer

À propos de : Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) Goto Sponge NotDistinct Permalink

Attributs	Valeurs
type	Concept
rdfs:seeAlso	Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
skos:inScheme	MSC 2010
broader concept	Theory of computing
skos:prefLabel	Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) Modelli di computazione (nondeterministica, parallela, interattiva, probabilistica ecc.) 计算模式(非确定性、并行的、交互的、概率的等)
skos:exactMatch	http://msc2010.org/resources/MSC/2000/68Q10
skos:altLabel	Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) [See also 68Q85] 计算模式(非确定性、并行的、交互的、概率的等)[参见68Q85] Modelli di computazione (nondeterministica, parallela, interattiva, probabilistica ecc.) [Vedi anche 68Q85]
http://msc2010.org...0/msc2010#seeAlso	Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
skos:closeMatch	from MSC1991 value of: Modes of computation (concurrent, parallel, nondeterministic, etc.), [See also 68Q90]
skos:notation	68Q10
skos:note	See also 68Q85.
skos:relatedMatch	http://msc2010.org/resources/MSC/2010/fullDD21-005.13
skos:semanticRelation	Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
is Subject of	Characteristic Formulae for Timed Automata Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata Different time solutions for the firing squad synchronization problem on basic grid networks Binary operations on automatic functions Quantum finite automata with control language Measuring the problem-relevant information in input Superiority of one-way and realtime quantum machines Unambiguous recognizable two-dimensional languages A survey on combinatorial optimization in dynamic environments Probabilistic models for pattern statistics An upper bound for transforming self-verifying automata into deterministic ones Strategies to scan pictures with automata based on Wang tiles Normal forms for unary probabilistic automata Hierarchies of weakly monotone restarting automata A note on Coinduction and Weak Bisimilarity for While Programs Pipelined Decomposable BSP Computers Lower Bounds for Las Vegas Automata by Information Theory Time and space complexity of reversible pebbling On the accepting state complexity of operations on permutation automata Immunity and Simplicity for Exact Counting and Other Counting Classes Division in logspace-uniform NC1 Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs On the Size of One-way Quantum Finite Automata with Periodic Behaviors On the power of two-way multihead quantum finite automata Parameterizing higher-order processes on names and processes
is narrower concept of	Theory of computing

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata