Results 21 to 30 of about 2,141 (287)
Unambiguous Büchi Is Weak [PDF]
, 2016 A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree automata is still not well-understood. In particular, decidability of the problem whether a given language is recognisable by some unambiguous automaton is open.
Henryk Michalewski, Michal Skrzypczak
openaire +2 more sources
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata [PDF]
, 2009 International audienceThis paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characterization involving so-called metatransitions and an ...
Kirsten, Daniel, Lombardy, Sylvain
core +4 more sources
Sensors, 2022 Channel phase calibration is a crucial issue in high resolution and wide swath (HRWS) imagery with azimuth multi-channel synthetic aperture radar (SAR) systems.
Man Zhang +3 more
doaj +1 more source
Theoretical Computer Science, 2012 A nonerasing morphism $\sigma$ is said to be weakly unambiguous with respect to a word $w$ if $\sigma$ is the only nonerasing morphism that can map $w$ to $\sigma(w)$, i.\,e., there does not exist any other nonerasing morphism $\tau$ satisfying $\tau(w) = \sigma(w)$.
Dominik D. Freydenberger +2 more
openaire +7 more sources
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carton, Olivier, Michel, Max
openaire +5 more sources
UNAMBIGUOUS MORPHIC IMAGES OF STRINGS [PDF]
International Journal of Foundations of Computer Science, 2005 We study a fundamental combinatorial problem on morphisms in free semigroups: With regard to any string α over some alphabet we ask for the existence of a morphism σ such that σ(α) is unambiguous, i.e. there is no morphism τ with τ(i) ≠ σ(i) for some symbol i in α and, nevertheless, τ(α) = σ(α). As a consequence of its elementary nature, this question
Dominik D. Freydenberger +2 more
openaire +2 more sources
Unambiguity in Automata Theory (Dagstuhl Seminar 21452)
, 2022 This report documents the program and the outcomes of Dagstuhl Seminar 21452 "Unambiguity in Automata Theory". The aim of the seminar was to improve the understanding of the notion of unambiguity in automata theory, especially with respect to questions ...
Skrzypczak, Michał +2 more
core +1 more source
Annales Universitatis Mariae Curie-Skłodowska. Sectio K, Politologia, 2019 The intelligibility of initiative proposals is of utmost importance in case of direct democratic decisions. This study sums up the tools by means of which voters are informed about referendum issues in countries or states with well developed direct ...
László Komáromi, Gabriella Antalicz
doaj +1 more source
Technical and methodological recommendations for turbogenerators diagnostics [PDF]
Biuletyn Wojskowej Akademii Technicznej, 2015 The paper presents the elements of the principles of diagnosing the technical condition of turbogenerators. The problem was examined in terms of methodology based on the types of sensors and their distribution structure and principles of analysis of ...
Włodzimierz Przyborowski
doaj +1 more source
Signals, 2021 The cross-correlation function (CCF) is an established technique to calculate time-of-flight for ultrasonic signals. However, the quality of the CCF depends on the shape of the input signals. In many use cases, the CCF can exhibit secondary maxima in the
Marius Schäfer +3 more
doaj +1 more source