1052 search results - page 47 / 211 » The Regular Real-Time Languages |
104
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
108
Voted
FCT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
106
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
100
Voted
CAI
2009
Springer
15 years 10 months ago
2009
Springer
STACS
2007
Springer
15 years 9 months ago
2007
Springer