Results 251 to 260 of about 1,815 (295)

Valuations and unambiguity of languages [PDF]

, 1994
Fernau, H., Staiger, L.
core  

Evaluating content validity for a culturally relevant wellness scale for women: the HER-WELL scale. [PDF]

Front Glob Womens Health
AlNujaidi HY, Al-Rayes SA, Alumran A, AlNujaidi DY, Alhafid IA, Al Yousif GF.   +5 more
europepmc   +1 more source

EU protection requirements for ePortfolios in clinical healthcare education. [PDF]

BMC Med Educ
Embo M, Wasiak C, Verschaeve S, Van Acker L, Timmers M, Lievens E.   +5 more
europepmc   +1 more source

Unambiguity of circuits [PDF]

Theoretical Computer Science, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klaus-Jörn Lange
exaly   +5 more sources

Hierarchical Unambiguity [PDF]

Lecture Notes in Computer Science, 2006
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs involving arbitrary higher levels of the relativized unambiguous polynomial hierarchy (UPH).
Rahul Tripathi, Holger Spakowski, Tripathi Rahul   +2 more
exaly   +4 more sources

On the Power of Unambiguity in Alternating Machines [PDF]

Lecture Notes in Computer Science, 2005
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of efficient protocols involving globally-unique games by Crâsmaru et al. [CGRS04].
Rahul Tripathi, Holger Spakowski, Tripathi Rahul   +2 more
exaly   +2 more sources

Sequentialization and Unambiguity of (Max,+) Rational Series Over One Letter [PDF]

IFAC Postprint Volumes IPPV / International Federation of Automatic Control, 2001
International audienceWe present an algorithm to decide whether a (max,+)-rational series over one letter is sequential.
Sylvain Lombardy
exaly   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Revisiting unambiguous discrimination

Quantum Information Processing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wen-Hai Zhang, Lan-Lan Li, Ke Zhang, Wen-Yan Nie   +3 more
openaire   +2 more sources

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata

Theory of Computing Systems, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoine Mottet, Karin Quaas
openaire   +2 more sources

Making nondeterminism unambiguous

Proceedings 38th Annual Symposium on Foundations of Computer Science, 2000
Summary: We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as \[ \begin{aligned} \text{NL/poly} &= \text{UL/poly},\\ \text{LogCFL ...
Klaus Reinhardt, Eric Allender
openaire   +3 more sources