Publications associées à Automate fini inambigu

Lower Bounds for Unambiguous Automata via Communication Complexity

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

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

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Light refocusing with up-scalable resonant waveguide gratings in confocal prolate spheroid arrangements

Olivier Martin, Zdenek Benes, Benjamin Gallinet, Giorgio Quaranta, Guillaume Basset

Resonant waveguide gratings (RWGs) are thin-film structures, where coupled modesinterfere with the diffracted incoming wave and produce strong angular and spectral filtering. The combination of two finite-length and impedance matched RWGs allows the creati ...

2018

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

High-Frequency Electromagnetic Coupling to Multiconductor Transmission Lines of Finite Length

Marcos Rubinstein, Gaspard Lugrin

This paper presents a theory and an efficient solution approach for the problem of electromagnetic field coupling to a long multiconductor line with arbitrary terminations. The theory is applicable for a high-frequency plane wave electromagnetic field exci ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Jayakrishnan Unnikrishnan

Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...

Institute of Electrical and Electronics Engineers2015

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Automate fini inambigu

Lower Bounds for Unambiguous Automata via Communication Complexity

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

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Spectral gaps of frustration-free spin systems with boundary

Light refocusing with up-scalable resonant waveguide gratings in confocal prolate spheroid arrangements

Measuring and Synthesizing Systems in Probabilistic Environments

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

High-Frequency Electromagnetic Coupling to Multiconductor Transmission Lines of Finite Length

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Graph Chatbot

Chattez avec Graph Search

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

Spectral gaps of frustration-free spin systems with boundary

Light refocusing with up-scalable resonant waveguide gratings in confocal prolate spheroid arrangements

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Measuring and Synthesizing Systems in Probabilistic Environments

High-Frequency Electromagnetic Coupling to Multiconductor Transmission Lines of Finite Length

Lower Bounds for Unambiguous Automata via Communication Complexity

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences