Amanote Research

Amanote Research

    RegisterSign In

A Representable Approach to Finite Nondeterminism

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(96)00232-0
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

April 1, 1997

Authors
S.O. AndersonA.J. Power
Publisher

Elsevier BV


Related search

A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1997English

A Nonlocal Finite Element Approach to Nanobeams

Advances in Mechanical Engineering
Mechanical Engineering
2013English

Representable Monoids

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1978English

Classical Realizability as a Classifier for Nondeterminism

2018English

A Finite State Approach to German Verb Morphology

1988English

An Axiomatic Approach to Finite Means

Information Sciences
ControlSystems EngineeringManagementTheoretical Computer ScienceComputer Science ApplicationsInformation SystemsArtificial IntelligenceSoftware
2018English

On the Succinctness of Nondeterminism

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Finite Element Approach to Contact Problems

Transactions of the Japan Society of Mechanical Engineers
1977English

A New Approach to Cutting Into Finite Element Models

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy