762 search results - page 32 / 153 » Intercode Regular Languages |
101
click to vote
BIRTHDAY
2004
Springer
15 years 7 months ago
2004
Springer
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
131
click to vote
IS
2011
14 years 9 months ago
2011
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
LATA
2009
Springer
15 years 9 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
91
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
118
click to vote
JUCS
2002
15 years 1 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...