Sciweavers

1052 search results - page 98 / 211
» The Regular Real-Time Languages
Sort
View
FOSSACS
2007
Springer
15 years 10 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
PLANX
2007
15 years 5 months ago
Lux: A Lightweight, Statically Typed XML Update Language
Several proposals for updating XML have been introduced. Many of them have a rather complicated semantics due to the interaction of side-effects and updates, and some proposals a...
James Cheney
NC
2008
126views Neural Networks» more  NC 2008»
15 years 3 months ago
Spiking neural P systems with extended rules: universality and languages
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
MFCS
2005
Springer
15 years 9 months ago
Strict Language Inequalities and Their Decision Problems
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Alexander Okhotin
ACL
2007
15 years 5 months ago
Mildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
Marco Kuhlmann, Mathias Möhl