Concept

Induction of regular languages

Related publications (32)

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.

Deductive Synthesis and Repair

Etienne Kneuss

In this thesis, we explore techniques for the development of recursive functional programs over unbounded domains that are proved correct according to their high-level specifications. We present algorithms for automatically synthesizing executable code, st ...

EPFL2016

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Automatic social role recognition and its application in structuring multiparty interactions

Ashtosh Sapru

Automatic processing of multiparty interactions is a research domain with important applications in content browsing, summarization and information retrieval. In recent years, several works have been devoted to find regular patterns which speakers exhibit ...

EPFL2015

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

SpeakUp – A Mobile App Facilitating Audience Interaction

Adrian Christian Holzer, Andrii Vozniuk, Sten Govaerts, Benoît Garbinato

A dynamic student-teacher interaction during class is an important part of the learning experience. However, in regular class settings and especially in large classrooms, it is a challenging task to encourage students to participate as they tend to be inti ...

2013

A Cognitive Reference Based Model for Learning Compositional Hierarchies with Whole-Composite Tags

Alain Wegmann, Anshuman Bahadur Saxena, Ashish Kishore Bindal

A compositional hierarchy is the default organization of knowledge acquired for the purpose of specifying the design requirements of a service. Existing methods for learning compositional hierarchies from natural language text, interpret composition as an ...

2013

Symbolic execution of Reo circuits using constraint automata

Hossein Hojjat

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

2012

We study the problem of distributed Kalman filtering and smoothing, where a set of nodes is required to estimate the state of a linear dynamic system from in a collaborative manner. Our focus is on diffusion strategies, where nodes communicate with their d ...

IEEE2010

Comparing coordination schemes for miniature robotic swarms: A case study in boundary coverage of regular structures

Alcherio Martinoli, Nicolaus Correll, Samuel Rutishauser

We consider boundary coverage of a regular structure by a swarm of miniature robots, and compare a suite of three fully distributed coordination algorithms experimentally. All algorithms rely on boundary coverage by reactive control, whereas coordination o ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an effective algorithm for detecting such repeated geometric patterns in point- o ...

Association for Computing Machinery2008