Sciweavers

762 search results - page 130 / 153
» Intercode Regular Languages
Sort
View
COGSCI
2008
139views more  COGSCI 2008»
13 years 7 months ago
A Computational Model of Early Argument Structure Acquisition
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Afra Alishahi, Suzanne Stevenson
NN
2007
Springer
162views Neural Networks» more  NN 2007»
13 years 7 months ago
Learning grammatical structure with Echo State Networks
Echo State Networks (ESNs) have been shown to be effective for a number of tasks, including motor control, dynamic time series prediction, and memorizing musical sequences. Howeve...
Matthew H. Tong, Adam D. Bickett, Eric M. Christia...
PPDP
2010
Springer
13 years 5 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch
FOSSACS
2009
Springer
14 years 2 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund