arXiv subjects

Satoshi Kobayashi

Publications and source records attributed to Satoshi Kobayashi.

7 recordsLinked to original sources

arXiv2024

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors

This paper deals with the control generation of right linear grammars with unknown behaviors (RLUBs, for short) in which derivation behavior is not determined completely. In particular, we consider a physical property of control devices used in control systems and formulate it as a partial order over control alphabet of the control system. We give necessary and sufficient conditions for given finite language classes to be generated by RLUBs and their control systems using a given partial order over control alphabet.

cs.FL↗

arXiv2020

Fast and linear-time string matching algorithms based on the distances of $q$-gram occurrences

Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the string matching problem is a task to find all occurrences of $P$ in $T$. In this study, we propose an algorithm that solves this problem in $O((n + m)q)$ time considering the distance between two adjacent occurrences of the same $q$-gram contained in $P$. We also propose a theoretical improvement of it which runs in $O(n + m)$ time, though it is not necessarily faster in practice. We compare the execution times of our and existing algorithms on various kinds of real and artificial datasets such as an English text, a genome sequence and a Fibonacci string. The experimental results show that our algorithm is as fast as the state-of-the-art algorithms in many cases, particularly when a pattern frequently appears in a text.

cs.DS↗

arXiv2019

Room Temperature Electrically Detected Nuclear Spin Coherence of NV Centers in Diamond

We demonstrate electrical detection of the $^{14}$N nuclear spin coherence of NV centers at room temperature. Nuclear spins are candidates for quantum memories in quantum-information devices and quantum sensors, and hence the electrical detection of nuclear spin coherence is essential to develop and integrate such quantum devices. In the present study, we used a pulsed electrically detected electron-nuclear double resonance technique to measure the Rabi oscillations and coherence time ($T_2$) of $^{14}$N nuclear spins in NV centers at room temperature. We observed $T_2 \approx$ 0.9 ms at room temperature. Our results will pave the way for the development of novel electron- and nuclear-spin-based diamond quantum devices.

cond-mat.mes-hall↗

arXiv2018

Quantum interferometric generation of polarization entangled photons

Quantum interference, like Hong-Ou-Mandel interference, has played an important role to test fundamental concepts in quantum physics. We experimentally show that the multiple quantum interference effects enable the generation of high-performance polarization entangled photons. These photons have a high-emission rate, are degenerate, have a broadband distribution, and are postselection free. A quantum interferometric scheme, based on a round-trip configuration of a double-pass polarization Sagnac interferometer, makes it possible to use the large generation efficiency of polarization entangled photons in the process of parametric down-conversion and to separate degenerate photon pairs into different optical modes with no requirement of postselection. We demonstrate experimentally that multiple quantum interference is not only an interesting fundamental quantum optical phenomenon but can be used for novel photonic quantum information technologies.

quant-ph↗

arXiv2015

A Germanium-Vacancy Single Photon Source in Diamond

Color centers in diamond are widely recognized as a promising solid state platform for quantum cryptography and quantum information processing. For these applications, single photon sources with a high intensity and reproducible fabrication methods are required. Here, we report a novel color center in diamond, composed of a germanium (Ge) and a vacancy (V) and named the GeV center, which has a sharp and strong photoluminescence band with a zero-phonon line at 602 nm at room temperature. We demonstrate this new color center works as a single photon source. Both ion implantation and chemical vapor deposition techniques enabled fabrication of GeV centers in diamond. A first-principles calculation revealed the atomic crystal structure and energy levels of the GeV center.

cond-mat.mtrl-sci↗

arXiv2012

On the Properties of Language Classes Defined by Bounded Reaction Automata

Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linearbounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by lambda-LRAs) by allowing lambda-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and lambda-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following : (i) the class of languages accepted by lambda-LRAs forms an AFL with additional closure properties, (ii) any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA, (iii) the class of languages accepted by ERAs coincides with the class of context-sensitive languages.

cs.FL↗

arXiv2011

Reaction Automata

Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction automata are computationally Turing universal. Further, some subclasses of reaction automata with space complexity are investigated and their language classes are compared to the ones in the Chomsky hierarchy.

cs.FL↗