Sciweavers

1052 search results - page 83 / 211
» The Regular Real-Time Languages
Sort
View
142
Voted
FASE
2006
Springer
15 years 7 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt
121
Voted
TON
2012
13 years 6 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
134
Voted
ISOLA
2004
Springer
15 years 9 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
146
Voted
JFP
2006
90views more  JFP 2006»
15 years 3 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
146
Voted
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 1 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...