423 search results - page 16 / 85 » The Generalization of Generalized Automata: Expression Autom... |
TAPSOFT
1991
Springer
14 years 7 days ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
ANCS
2007
ACM
14 years 23 days ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
MT
2007
13 years 8 months ago
2007
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
RIA
2006
13 years 8 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...