33 search results - page 3 / 7 » Complexity of regular abstractions of one-counter languages |
CSR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
ICGI
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
CONSTRAINTS
2006
13 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...