Concept

Nondeterministic finite automaton

Related publications (118)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023

Novel Design and Implementation of a Neuromuscular Controller on a Hip Exoskeleton for Partial Gait Assistance

Auke Ijspeert, Mohamed Bouri, Ali Reza Manzoori, Andrea Di Russo, Sara Messara

Exoskeletons intended for partial assistance of walking should be able to follow the gait pattern of their users, via online adaptive control strategies rather than imposing predefined kinetic or kinematic profiles. NeuroMuscular Controllers (NMCs) are ada ...

2023

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Sample Complexity of Linear Quadratic Gaussian (LQG) Control for Output Feedback Systems

Maryam Kamgarpour, Luca Furieri, Na Li

This paper studies a class of partially observed Linear Quadratic Gaussian (LQG) problems with unknown dynamics. We establish an end-to-end sample complexity bound on learning a robust LQG controller for open-loop stable plants. This is achieved using a ro ...

PMLR2021

A Space-Time Adaptive Algorithm to Illustrate the Lack of Collision of a Rigid Disk Falling in an Incompressible Fluid

Marco Picasso, Samuel Dubuis

A space-time adaptive algorithm to solve the motion of a rigid disk in an incompressible Newtonian fluid is presented, which allows collision or quasi-collision processes to be computed with high accuracy. In particular, we recover the theoretical result p ...

WALTER DE GRUYTER GMBH2021

Digital Design with Implicit State Machines

Martin Odersky, Aleksandar Prokopec, Fengyun Liu

Claude Shannon, in his famous thesis (1938), revolutionized circuit design by showing that Boolean algebra subsumes all ad-hoc methods that are used in designing switching circuits, or combinational circuits as they are commonly known today. But what is ...

2020

Dynamical collapse of cylindrical symmetric Dipolar Bose-Einstein condensates

Luigi Forcella

We study the formation of singularities for cylindrical symmetric solutions to the Gross-Pitaevskii equation describing a Dipolar Bose-Einstein condensate. We prove that solutions arising from initial data with energy below the energy of the Ground State a ...

2020