A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Nondeterministic operations on finite relational structures

1998
*
Theoretical Computer Science
*

We

doi:10.1016/s0304-3975(97)00263-6
fatcat:r22a673slnfk7kf2hzjzcr7rda
*relate*them to the logical theory of*finite**relational**structures*and hypergraphs. ... First,*nondeterministic**operations*are considered, i.e.,*operations*which give a set of results instead of a single*one*. ...*Finite**relational**structures*and*nondeterministic**operations*Now we look at examples for*nondeterministic**operations*. ...##
###
A Mathematical Game Semantics of Concurrency and Nondeterminism
[chapter]

2015
*
Lecture Notes in Computer Science
*

The model based

doi:10.1007/978-3-319-25150-9_35
fatcat:kyfxxg3icjcbln7o4mgfyz6z3e
*on*closure*operators*exposes many interesting mathematical properties and allows*one*to define connections with many other semantic models where closure*operators*are also used. ... Concurrent games as event*structures*form a partial order model of concurrency where concurrent behaviour is captured by*nondeterministic*concurrent strategies-a class of maps of event*structures*. ... Based*on*Theorem 5, which*relates*the standard definition of strategies as maps of event*structures*with strategies as*nondeterministic*closure*operators*, known techniques to characterise winning strategies ...##
###
Turing Machines with Atoms

2013
*
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
*

Our main result is that deterministic machines are weaker than

doi:10.1109/lics.2013.24
dblp:conf/lics/BojanczykKLT13
fatcat:bntizruis5bezdfgmwuemw7jje
*nondeterministic**ones*; in particular, P =NP in sets with atoms. ... Our main construction is closely*related*to the Cai-Fürer-Immerman graphs used in descriptive complexity theory. ... Sets without atoms correspond to the empty*relational**structure*. ...##
###
Page 4831 of Mathematical Reviews Vol. , Issue 83m
[page]

1983
*
Mathematical Reviews
*

(English and Russian summaries) [

*On*the*structure*theory of*finite**nondeterministic*automata. I.*On*the lattice of 1-congruences of*finite**relational*systems] Elektron. Informationsverarb. ... (English and Russian summaries) [*On*the*structure*theory of*finite**nondeterministic*automata. II. Control sums and control trees of*nondeterministic*automata] Elektron. Informationsverarb. ...##
###
A generalization of Kleene's theorem and nondeterministic structured programming

1981
*
Information and Control
*

In the case of the c.o. monoid of all binary

doi:10.1016/s0019-9958(81)90235-7
fatcat:a4diuff355cfpm2j3cuf6t37tq
*relations**on*a set we obtain the computational equivalence between flowchart-like*nondeterministic*programs and*structured**nondeterministic*programs constructed ... using the generalization of the rational*operations**on*languages. ... Applying the theorem to binary*relations**on*a set we obtain the computational equivalence between two programming doctrines for*nondeterministic*programs, a general doctrine and a*structured*doctrine. ...##
###
Page 3382 of Mathematical Reviews Vol. , Issue 92f
[page]

1992
*
Mathematical Reviews
*

It concentrates

*on*problems of algebraic and*structural*automata theory such as the following: computation of function-preserving*operations*of*finite*automata with state transformations and state-input ... 921:68116 Hence rewriting is at the heart of all three execution models, which makes their combination quite simple*on*the*operational*side. ...##
###
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)
[chapter]

1999
*
Lecture Notes in Computer Science
*

In Section 4, a number of laws for the familiar

doi:10.1007/3-540-48523-6_61
fatcat:vy4zavldsfahpa5rbwq7nnm2na
*operators**on*formal power series, will be shown to have easy proofs by coinduction. ... of a congruence*relation*). ... Note that it does not depend*on*the semiring*structure*of k. ...##
###
Page 2168 of Mathematical Reviews Vol. , Issue 82e
[page]

1982
*
Mathematical Reviews
*

A

*relational**structure*is defined as a*finite*set S and a collection R,,---,R, of*relations**on*S; e.g., a graph consists of a vertex set S and*one*binary (symmetric and irreflexive) adjacency*relation*... The author discusses an alternative approach, based*on*formal logic and due to R. Fagin (“Contributions to the model theory of*finite**structures*”, Ph.D. Thesis, Univ. ...##
###
Page 2814 of Mathematical Reviews Vol. , Issue 92e
[page]

1992
*
Mathematical Reviews
*

This part also contains remarks

*on*interpretability*operations**on*data*structures*which are typical for defining (implementing) new data*structures*. ... To describe the*nondeterministic*interpretation of programs*one*uses modal formulas (Ka: there is a*finite*computation of K end- ing with a state satisfying a, OKa: all computations of K are*finite*and ...##
###
Structural operational semantics and bounded nondeterminism

2003
*
Acta Informatica
*

We present a rule format for

doi:10.1007/s00236-003-0111-1
fatcat:dgycxetldrg4vbywpwxxzttdpi
*structural**operational*semantics to guarantee that the associated labelled transition system is bounded*nondeterministic*. ...*Structural**operational*semantics This chapter introduces the basic notions about*structural**operational*semantics needed in the rest of this paper. ... Rule formats for*structural**operational*semantics are a convenient approach for obtaining certain results*on*process algebras and LTSs in general (see [1] for an overview). ...##
###
A Novel Approach for the Determination of Membership Values of the Strings in Fuzzy Languages

2014
*
International Journal of Computer Applications
*

They proved that

doi:10.5120/17548-8144
fatcat:qb7chkpssze5vfqsemrqroof3y
*nondeterministic*fuzzy automata are not closed under the Complement*operation*and the deterministic fuzzy automata are not closed under the Kleene closure*operation*. ... Fuzzy automata fully dependent*on*membership value and these values can be taken with complete lattice, lattice ordered monoid, and many other algebraic*structure*. ...##
###
Bicategorical Semantics for Nondeterministic Computation
[article]

2013
*
arXiv
*
pre-print

Specific implementations of these protocols as

arXiv:1301.3393v1
fatcat:riccfou7brcbfdnq4ca3qkcxpa
*nondeterministic*classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of*relations*. ...*Relations*provide a standard semantics for*nondeterministic*computation [11] , and our bicategory builds*on*this. ... Suppose at first that σ and τ are*relations**on*a*finite*set S. Then if σ • τ = id S , there must be at least*one*y ∈ S such that (x, y) ∈ σ and (y, x) ∈ τ . ...##
###
On the Succinctness of Nondeterminism
[chapter]

2006
*
Lecture Notes in Computer Science
*

It is not clear, however, whether and how it is possible to

doi:10.1007/11901914_12
fatcat:hv2aeurg7zdzbjl5g344vr6tmu
*relate**nondeterministic*automata for R and L, or to*relate**nondeterministic*automata to which different limit*operators*are applied. ... For the three limit*operators*, the deterministic automata for R and L share the same*structure*. ... Succinctness Among the Different Limit*Operators*In the previous section, we*related*NFWs with Büchi and co-Büchi automata. ...##
###
On Weakly Ambiguous Finite Transducers
[chapter]

2006
*
Lecture Notes in Computer Science
*

IU transductions are characterized by

doi:10.1007/11779148_15
fatcat:wrblrbaom5b3fmi7kkfeinqpbm
*nondeterministic*bimachines and ID transductions can be represented as a composition of sequential functions and*finite*substitutions. ... Perhaps the most important aspect of this work consists in defining*nondeterministic*bimachines and describing their power by linking them with weakly ambiguous*finite*transducers (IU and FA). ... FNObm : with*finitely**nondeterministic*output (at each "step" the bimachine*nondeterministically*writes a word*on*the output tape, choosing from a*finite*set of choices); 2. ...##
###
Page 5984 of Mathematical Reviews Vol. , Issue 94j
[page]

1994
*
Mathematical Reviews
*

*On*the whole, a dozen

*operations*

*related*to deletion, and a dozen

*operations*

*related*to insertion as well, are introduced. ... It is known that

*nondeterministic*

*finite*automata (NFAs) can be exponentially more concise than deterministic

*finite*automata (DFAs) in their representations of regular languages. ...

« Previous

*Showing results 1 — 15 out of 23,287 results*