Sciweavers

278 search results - page 34 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
ACL
1998
13 years 9 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
PAMI
1998
87views more  PAMI 1998»
13 years 7 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow
FOSSACS
2009
Springer
13 years 11 months ago
On Omega-Languages Defined by Mean-Payoff Conditions
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weis...
LREC
2010
173views Education» more  LREC 2010»
13 years 9 months ago
Heterogeneous Data Sources for Signed Language Analysis and Synthesis: The SignCom Project
This paper describes how heterogeneous data sources captured in the SignCom project may be used for the analysis and synthesis of French Sign Language (LSF) utterances. The captur...
Kyle Duarte, Sylvie Gibet