Sciweavers

756 search results - page 12 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
IJCNN
2008
IEEE
14 years 2 months ago
A formula of equations of states in singular learning machines
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...
Sumio Watanabe
VLDB
2002
ACM
110views Database» more  VLDB 2002»
13 years 7 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
13 years 11 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
FASE
2006
Springer
13 years 11 months ago
Regular Inference for State Machines with Parameters
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Therese Berg, Bengt Jonsson, Harald Raffelt
JFP
2008
135views more  JFP 2008»
13 years 7 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...