LATA
2010
Springer
13 years 11 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)