759 search results - page 24 / 152 » Overlap-Free Regular Languages |
CAI
2009
Springer
14 years 3 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...
COCOON
2004
Springer
14 years 7 days ago
2004
Springer
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
WIA
1999
Springer
1999
Springer
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
14 years 22 days ago
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
CALCO
2005
Springer
14 years 2 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...