762 search results - page 43 / 153 » Intercode Regular Languages |
96
Voted
DAM
2007
15 years 2 months ago
2007
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular...
116
click to vote
CAI
2009
Springer
15 years 9 months ago
2009
Springer
The aim of this paper is to collect definitions and results on the main classes of 2D languages introduced with the attempt of generalizing regular and context-free string languag...
137
click to vote
TCS
2008
15 years 2 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
113
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We provide a complete description of the Wadge hierarchy for deterministically recognizable sets of infinite trees. In particular we give an elementary procedure to decid...
80
Voted
CALCO
2005
Springer
15 years 7 months ago
2005
Springer
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...