1052 search results - page 64 / 211 » The Regular Real-Time Languages |
167
Voted
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
146
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The need to quickly and accurately classify Internet traffic for security and QoS control has been increasing significantly with the growing Internet traffic and applications ov...
109
click to vote
BIRTHDAY
2004
Springer
15 years 9 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.
LATA
2009
Springer
15 years 10 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 ...
126
Voted
FOSSACS
2011
Springer
14 years 7 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...