1052 search results - page 41 / 211 » The Regular Real-Time Languages |
181
click to vote
CORR
2009
Springer
15 years 3 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
141
click to vote
FSTTCS
2009
Springer
16 years 15 days ago
2009
Springer
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
175
click to vote
ICALP
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
208
click to vote
LATA
2012
Springer
14 years 1 months ago
2012
Springer
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...
170
click to vote
ADBIS
2000
Springer
15 years 9 months ago
2000
Springer
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...