Sciweavers

595 search results - page 34 / 119
» Languages Of Analogical Strings
Sort
View
JALC
2007
95views more  JALC 2007»
14 years 9 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
FOSSACS
2007
Springer
15 years 3 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
NC
2008
126views Neural Networks» more  NC 2008»
14 years 9 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,...
ICEC
1994
147views more  ICEC 1994»
14 years 11 months ago
VLSI Circuit Synthesis Using a Parallel Genetic Algorithm
A parallel implementation of a genetic algorithm used to evolve simple analog VLSI circuits is described. The parallel computer system consisted of twenty distributed SPARC workst...
Mike Davis, Luoping Liu, John G. Elias
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 4 months ago
MDLn: A Motion Description Language for networked systems
— In this paper we extend the definition of a Motion Description Language (MDL) to networked systems. This new construction (MDLn) supports inter-agent specification rules as w...
Patrick Martin, Jean-Pierre de la Croix, Magnus Eg...