Results 81 to 90 of about 2,538 (309)
Multimodal Human–Robot Interaction Using Human Pose Estimation and Local Large Language Models
Advanced Robotics Research, EarlyView.A multimodal human–robot interaction framework integrates human pose estimation (HPE) and a large language model (LLM) for gesture‐ and voice‐based robot control. Speech‐to‐text (STT) enables voice command interpretation, while a safety‐aware arbitration mechanism prioritizes gesture input for rapid intervention.
Nasiru Aboki +2 more
wiley +1 more source
Sublinearly space bounded iterative arrays
, 2007 Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata.
B.S. Palano +5 more
core
Computation of distances for regular and context-free probabilistic languages
, 2008 Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source
Weakly and strongly irreversible regular languages [PDF]
, 2017 Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages ...
G.J. Lavado +2 more
core +1 more source
LLM‐Integrated Human–Robot Interaction System for Microrobots
Advanced Robotics Research, EarlyView.This paper proposes an LLM‐based control framework for guiding microrobots using human natural language. This framework can convert the natural human speech into safe and executable command sets for reliable navigation in complex environments. The experimental results show high accuracy and robustness in task performance, demonstrating the potential of
Bairong Zhu, Amar Salehi, Tingting Yu
wiley +1 more source
Minimizing finite automata is computationally hard
, 2002 It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core
A Perspective on Interactive Theorem Provers in Physics
Advanced Science, EarlyView.Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley +1 more source
VisA: A Tool for Visualizing and Animating Automata and Formal Languages [PDF]
, 1998 The use of multimedia tools in education has gained a lot of interest during the last decade (see, e.g., [1]). Free standing multimedia as well as tutorials distributed via the Internet provide the potential for students to learn on their own, at their own pace, and in their own sequence, whereas textbooks or instructors usually impose a sequence how ...
Markus Holzer 0001, Muriel Quenzer
openaire +1 more source
, 2005 MONA implements an efficient decision procedure for the logic WS1S, and has already been applied in many non-trivial problems. Among these, we follow on from previous work done by Smith and Klarlund on the verification of a sliding-window protocol.
Howard Bowman +2 more
core
Once-Marking and Always-Marking 1-Limited Automata
, 2023 Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as 1-limited automata.
G. Pighizzini +5 more
core +1 more source