Sciweavers

ACL
2010
13 years 2 months ago
Estimating Strictly Piecewise Distributions
Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classe...
Jeffrey Heinz, James Rogers
FCSC
2010
108views more  FCSC 2010»
13 years 2 months ago
On the computation of quotients and factors of regular languages
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
Mircea Marin, Temur Kutsia
INFORMATICALT
2002
77views more  INFORMATICALT 2002»
13 years 3 months ago
A New Algorithm of Constructing the Basis Finite Automaton
In this paper we consider non-deterministic finite Rabin
Boris Melnikov, Alexandra Melnikova
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
Pascal Tesson, Denis Thérien
ICGI
2010
Springer
13 years 5 months ago
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
Alexander Clark
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
13 years 5 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
13 years 5 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
DLT
2010
13 years 5 months ago
Computing Blocker Sets for the Regular Post Embedding Problem
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
Pierre Chambart, Philippe Schnoebelen
COCOON
2006
Springer
13 years 8 months ago
Overlap-Free Regular Languages
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
Yo-Sub Han, Derick Wood
ICALP
2010
Springer
13 years 9 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin