Results 261 to 270 of about 1,815 (295)
Some of the next articles are maybe not open access.
Noûs, 1987
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source
Recently, Allan Gibbard has argued that there is a semantic difference between indicative and subjunctive conditional sentences. His arguments, which derive in part from the work of E.W. Adams (see [1] and [2] for example), are presented in detail in [3].
openaire +1 more source
On the Strength of Unambiguous Tree Automata
International Journal of Foundations of Computer Science, 2018This work is a study of the class of non-deterministic automata on infinite trees that are unambiguous i.e. have at most one accepting run on every tree. The motivating question asks if the fact that an automaton is unambiguous implies some drop in the descriptive complexity of the language recognised by the automaton.
Michalewski, Henryk, Skrzypczak, Michał
openaire +3 more sources
Operations on Unambiguous Finite Automata
International Journal of Foundations of Computer Science, 2016A nondeterministic finite automaton is unambiguous if it has at most one accepting computation on every input string. We investigate the state complexity of basic regular operations on languages represented by unambiguous finite automata. We get tight upper bounds for reversal ([Formula: see text]), intersection ([Formula: see text]), left and right ...
Jozef Jirásek Jr. +2 more
openaire +2 more sources
2005
A nondeterministic finite automaton with e-transitions(eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem of how to compactify a given eNFA by reducing the number of transitions.
openaire +1 more source
A nondeterministic finite automaton with e-transitions(eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem of how to compactify a given eNFA by reducing the number of transitions.
openaire +1 more source
2013
In general, a nondeterministic automaton or machine (for example a finite automaton, pushdown automaton or Turing machine) is called unambiguous if each input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous.
openaire +1 more source
In general, a nondeterministic automaton or machine (for example a finite automaton, pushdown automaton or Turing machine) is called unambiguous if each input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous.
openaire +1 more source
Linguistic Inquiry, 1998
Triggers for parameter setting may be ambiguous. Strategies for dealing with ambiguity include guessing, parallel processing, and waiting for unambiguous input. The Trigger Learning Algorithm of Gibson and Wexler (1994) is a guessing system. Gibson and Wexler show that under some reasonable assumptions it may never attain the target grammar. I propose
openaire +1 more source
Triggers for parameter setting may be ambiguous. Strategies for dealing with ambiguity include guessing, parallel processing, and waiting for unambiguous input. The Trigger Learning Algorithm of Gibson and Wexler (1994) is a guessing system. Gibson and Wexler show that under some reasonable assumptions it may never attain the target grammar. I propose
openaire +1 more source
UNAMBIGUOUS SHARED-MEMORY SYSTEMS
International Journal of Foundations of Computer Science, 2010Shared-memory systems appear as a generalization of asynchronous cellular automata. In this paper we relate the partial-order semantics of shared-memory systems to Mazurkiewicz trace languages by means of a new refinement construction. We show that a set of labeled partial orders is recognized by some unambiguous shared-memory system if and only if it
openaire +1 more source
Tolerance for unambiguous feedback.
Journal of Personality and Social Psychology, 1965S E, FELDMAN, J K, RICE
openaire +2 more sources