7,845 Hits in 5.3 sec

Some results about centralized PC grammar systems

Jean-Michel Autebert
1999 Theoretical Computer Science  
In this note, we bring to evidence some techniques that can be performed on PC grammar systems working with linear grammars.  ...  generated by centralized PC grammar systems working with (right-)linear grammars, such as the closure under union and the closure under intersection with a rational set, and for centralized PC grammar  ...  The problem is stated open in the centralized case.  ... 
doi:10.1016/s0304-3975(98)00265-5 fatcat:wlojfzbne5cbhevsojzy52l7jy

On the computational power of context-free PC grammar systems

Niculae Mandache
2000 Theoretical Computer Science  
Since it was proven that such systems can be simulated by returning PC grammar systems with context-free components, the result extends to those.  ...  It is shown that non-returning parallel communicating grammar systems with -free contextfree components can generate any recursively enumerable language.  ...  Still, a basic question concerning the power of PC grammar systems is open: how large is the family of languages generated by context-free PC grammar systems in comparison with the families of context-sensitive  ... 
doi:10.1016/s0304-3975(98)00159-5 fatcat:czxsxipgljeoxjoay6nsmow42a

Parallel Communicating Grammar Systems [chapter]

Lila Santean
1993 Current Trends in Theoretical Computer Science  
Cooperating /distributed grammar systems are an attempt of modelling the process of communication [2] . They consist of a system of grammars working together to produce words of a language.  ...  Parallel communicating grammar systems have evolved from the following considerations: • Knowledge processing systems are characterized by an intimate cooperation between logic and functional programming  ...  Many specific problems have remained open as regards the generative capacity, the closure properties, complexity, etc.  ... 
doi:10.1142/9789812794499_0047 dblp:series/wsscs/Santean93 fatcat:fqcna5yxg5emzm7sqfityku7pq

Implementing a Small Parsing Virtual Machine on Embedded Systems [article]

Shun Honda, Kimio Kuramitsu
2015 arXiv   pre-print
PEGs are a formal grammar foundation for describing syntax, and are not hard to generate parsers with a plain recursive decent parsing.  ...  However, the large amount of C-stack consumption in the recursive parsing is not acceptable especially in resource-restricted embedded systems.  ...  To our knowledge, the parser generation that is specialized for embedded systems has been unexplored, and then is an important open problem to be addressed.  ... 
arXiv:1511.03406v1 fatcat:xytpwh5vcvajbmkbofupesmhum

Bicolored digraph grammar systems

Derick Wood
1973 Revue française d automatique informatique recherche opérationnelle Mathématique  
This enables us to state some open problems which are a resuit of looking at bdg Systems from this standpoint.  ...  INTRODUCTION There has been much interest in recent years in various extensions and modifications to the notion of grammar or generating System as studied by Chomsky (1959) .  ... 
doi:10.1051/m2an/197307r100451 fatcat:rtvu66tmxjcqboy4oe2a4oor4y

On the computational completeness of context-free parallel communicating grammar systems

Erzsébet Csuhaj-Varjú, György Vaszil
1999 Theoretical Computer Science  
We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter  ...  Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power. @ 1999-Elsevier Science B.V. All rights reserved  ...  Parallel communicating grammar systems have been the subject of detailed study over the last years: see [7] for a summary of results and open problems.  ... 
doi:10.1016/s0304-3975(98)00193-5 fatcat:uuu3eiez4vdzbmli2x5tkm2qwm

Grammar-based design of embedded systems

Johnny Öberg, Mattias O'Nils, Axel Jantsch, Adam Postula, Ahmed Hemani
2001 Journal of systems architecture  
Only in recent years grammar-based design has become a promising research ®eld and the ®rst commercial tools have appeared on the market.  ...  , and to the virtual prototyping of DSP systems.  ...  While the latter two can be derived from well-known digit-serial and high-level synthesis techniques, a grammar-based notation for data types is still an open question.  ... 
doi:10.1016/s1383-7621(00)00047-3 fatcat:mbxpsziqu5evfjeznqkqvh6zly

Decidability problems in grammar systems

Valeria Mihalache
1999 Theoretical Computer Science  
Most of the basic decision problems concerning derivations in cooperating distributed grammar systems have so far been open, possibly because of the lack of unifying methods and techniques.  ...  It is called a cow-ability tree because it bears some resemblance to the coverability graph of place/transition Petri nets and vector addition systems.  ...  Most of the results known in grammar systems area until 1992 can be found in [3] , while the most recent results are surveyed in [5] . Yet there are many challenging open questions.  ... 
doi:10.1016/s0304-3975(97)00165-5 fatcat:ndg73gcypnhcloxmby6pzfhsfq

Uniform Distributed Pushdown Automata Systems [chapter]

Fernando Arroyo, Juan Castellanos, Victor Mitrana
2012 Lecture Notes in Computer Science  
Some directions for further work and open problems are also discussed.  ...  which cooperating distributed (CD) grammar systems work.  ...  An entire theory has been developed for both types of grammar systems, see the monograph [5] and more recently the chapter [8] in [16] .  ... 
doi:10.1007/978-3-642-31623-4_5 fatcat:uub26eeee5fdlcmmkfirl5bauu

On the importance of sluggish state memory for learning long term dependency

Jonathan A. Tepper, Mahmud S. Shertil, Heather M. Powell
2016 Knowledge-Based Systems  
We show that memory units embedded within its architecture can ameliorate against the vanishing gradient problem, by providing variable sensitivity to recent and more historic information through layer-and  ...  This paper re-opens the case for SRN-based approaches, by considering a variant, the Multirecurrent Network (MRN).  ...  Introduction Recent studies have demonstrated that the ability to learn nonlinear temporal dynamic behaviour is a significant factor in the solution of numerous complex problem-solving tasks, such as those  ... 
doi:10.1016/j.knosys.2015.12.024 fatcat:lldtnmeaynh6vdfyfqp6fcqhvy

PHRED: A Generator for Natural Language Interfaces [chapter]

Paul S. Jacobs
1988 Natural Language Generation Systems  
This system answers questions and solves problems related to the UNIX 3 operating system.  ...  Having a knowledge base shared between analyzer and generator eliminates the redundancy of having separate grammars and lexicons for input and output.  ...  The same result might well be achieved within the basic framework of lexical functional grammar or unification grammar.  ... 
doi:10.1007/978-1-4612-3846-1_9 fatcat:27olgcjxznggjkh3ducomgbdcm

On context-free parallel communicating grammar systems: synchronization, communication, and normal forms

Erzsébet Csuhaj-Varjú, György Vaszil
2001 Theoretical Computer Science  
We demonstrate the equivalence of several types of these systems and present normal form theorems showing that all languages generated by context-free returning parallel communicating grammar systems can  ...  In this paper we study the generative power of context-free returning parallel communicating grammar systems using di erent synchronization mechanisms and communication protocols.  ...  Parallel communicating grammar systems have been the subject of detailed study over the last years: see [1, 3, 6] for a summary of results and open problems.  ... 
doi:10.1016/s0304-3975(99)00318-7 fatcat:ihjuijzi7vdypiuq5gcjq5nggu

ScienceTreks: an autonomous digital library system

Alexander Ivanyukovich, Maurizio Marchese, Fausto Giunchiglia, A.R.D. Prasad
2008 Online information review (Print)  
Findings -The proposed pipeline is implemented in a working prototype of an Autonomous Digital Library system -the ScienceTreks system -that: (1) support a broad range of methods for documents acquisition  ...  This, in turn, creates the opportunity for value-added services within existing and future semantic-enabled Digital Library systems.  ...  Lee Giles for useful comments and advice during initial brainstorming on the system architecture.  ... 
doi:10.1108/14684520810897368 fatcat:x7dhcwnjcreqzladrxidw6xniu

Language resources used in multi‐lingual question‐answering systems

María‐Dolores Olvera‐Lobo, Juncal Gutierrez‐Artacho
2011 Online information review (Print)  
However, grammar and ambiguity problems have recently reduced their popularity, so that only 5 of the 79 systems studied over the past four years used this resource.  ...  The inclusion of grammars in multi-lingual QA systems is relatively recent, and so the above classifications have not been taken into account.  ... 
doi:10.1108/14684521111161927 fatcat:wklvdlccpjfodgh6jyldoiuxua

Voice-Controlled Artificial Handspeak System

Jonathan Gatti, Carlo Fonda, Livio Tenze, Enrique Canessa
2014 International Journal of Artificial Intelligence & Applications  
A man-machine interaction project is described which aims to establish an automated voice to sign language translator for communication with the deaf using integrated open technologies.  ...  The core automation comprises an Arduino UNO controller used to activate a set of servo motors that follow instructions from a Raspberry Pi mini-computer having installed the open source speech recognition  ...  The whole integrated system consumes very little energy. Our open device is different from alternative approaches designed for those people with hearing problems.  ... 
doi:10.5121/ijaia.2014.5108 fatcat:npw5z37rljabbcjqjcmbjj3es4
« Previous Showing results 1 — 15 out of 7,845 results