Results 21 to 30 of about 1,815 (295)

Unambiguity in Automata Theory (Dagstuhl Seminar 21452) [PDF]

open access: yes, 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

Deterministic recognizability of picture languages with Wang automata [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Violetta Lonati, Matteo Pradella
doaj   +1 more source

Azimuth Unambiguity Suppression for Low-oversampled Staggered SAR Images

open access: yesLeida xuebao, 2021
Low-oversampled staggered synthetic aperture radar can achieve continuously observed high-resolution and wide-swath imaging by utilizing the variable pulse repetition interval to distribute blind ranges.
Xingxing LIAO, Zhe LIU, Junjie WU
doaj   +1 more source

Dynamic interferometric measurement with extended unambiguity range in flow measurement [PDF]

open access: yesEPJ Web of Conferences, 2018
This paper reports on a new approach to measure dynamic processes in fluid mechanics using interferometry with extended dynamic range. A key factor is the use of two wavelengths and the recording of interferograms from both wavelengths in one frame ...
Psota Pavel   +3 more
doaj   +2 more sources

UNAMBIGUOUS CONSTRAINED AUTOMATA [PDF]

open access: yesInternational Journal of Foundations of Computer Science, 2012
The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable ...
Michaël Cadilhac   +2 more
openaire   +2 more sources

Cooperative radar with signature method for unambiguity [PDF]

open access: yesAdvances in Radio Science, 2019
The increasing availability of off-the-shelf high-frequency components makes radar measurement become popular in mainstream industrial applications. We present a cooperative FM radar for strongly reflective environments, being devised for a range of up ...
S. Müller, A. R. Diewald
doaj   +1 more source

On M-unambiguity of Parikh matrices

open access: yesIndonesian Journal of Combinatorics, 2020
The Parikh matrix mapping was introduced by Mateescu et al. in 2001 as a canonical generalization of the classical Parikh mapping. The injectivity problem of Parikh matrices, even for ternary case, has withstanded numerous attempts over a decade by ...
Wen Chean Teh
doaj   +1 more source

Synthetic-wavelength interferometry improved with frequency calibration and unambiguity range extension [PDF]

open access: yes, 2022
S.6334-6343We improve the accuracy of distance measurements with synthetic-wavelength interferometry by referencing the spectral spacing of the free-running light sources to a high-precision radio-frequency oscillator.
Koos, Christian   +5 more
core   +1 more source

On the power of unambiguity in log-space [PDF]

open access: yescomputational complexity, 2012
14 pages, 3 ...
Aduri Pavan   +2 more
openaire   +4 more sources

Unambiguous Büchi Is Weak [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy