The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 3741 of Mathematical Reviews Vol. 58, Issue 5
[page]
1979
Mathematical Reviews
Preserved Fulltext
A grammatical inference prob- lem is presented in which the least complex stochastic regular grammar is sought which describes a given set of strings. ...
The authors outline the relevance of grammatical inference tech- niques to the semiautomatic construction from empirical data of a model of human decisionmaking. ...
Page 570 of Mathematical Reviews Vol. , Issue 97A
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
97a:68098
97a:68098 68Q45 68T0S
Makinen, Erkki (FIN-TAM-C; Tampere)
A note on the grammatical inference problem for even linear languages. (English summary)
Fund. Inform. 25 (1996), no. 2, 175-181. ...
It is shown that terminal-fixed even linear languages can be inferred from positive samples in linear time, the criterion for inference being “identification in the limit”. ...
Past, present and future
[chapter]
1980
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This is one example of an inference problem. 14) Is every sub-regular synchro-EOL form family a grammatical family? ...
A recent paper on Szilard languages of grammar forms is Maurer, Salomaa and Wood [1980g] . ...
doi:10.1007/3-540-10233-7_5
fatcat:2wsb2nskz5gcbcduvt2rvtsra4
An Extension of Finite-state Markov Decision Process and an Application of Grammatical Inference
[chapter]
2008
Reinforcement Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Notation and definitions Before we give the definition of simple context-free MDPs, we write some standard notation and definitions and introduce subclasses of simple grammars and probabilistic grammars ...
Reinforcement Learning: Theory and Applications 86 positive data, the one computing a most general grammar and the modified update equations of some usual reinforcement learning methods. ...
Therefore, we need to modify the results in grammatical inference area for applying them to reinforcement learning. ...
doi:10.5772/5276
fatcat:2rtphxd6sne2jftvmxqc3zf3qi
Polynomial-time identification of very simple grammars from positive data
2003
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This class of languages is also known as the class of left Szilard languages of context-free grammars. ...
This paper concerns a subclass of simple deterministic grammars, called very simple grammars, and studies the problem of identifying the subclass in the limit from positive data. ...
Yoshinaka for their crucial comments which pointed out aws in argument concerning the characteristic samples in the original version of this paper. Also, he would like to thank E. ...
doi:10.1016/s0304-3975(02)00423-1
fatcat:ld53cl5tzfaqjn7s55dog2xm5m
Learning deterministic even linear languages from positive examples
1997
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of learning deterministic even linear languages from positive examples. ...
As a corollary, in terms of even linear grammars, we have a learning algorithm for k-reversible languages that is more efficient than the one proposed by Angluin. ...
Acknowledgements The authors are grateful to thank Kazuhiro Yokoyama, Yasubumi Sakakibara, You Matsuo, and Steffen Lange for their valuable comments and suggestions. ...
doi:10.1016/s0304-3975(97)00016-9
fatcat:ktpfrwv7obehhmzgb5ejvwquw4
On the Complexity of Szilard Languages of Regulated Grammars
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated rewriting grammars. ...
The main goal is to relate these languages to lowlevel complexity classes such as N C 1 and N C 2 . We focus on the derivation process in random context grammars (RCGs) with context-free rules. ...
, grammatical inference, learning theory, and graph grammars [5] . ...
doi:10.1007/978-3-642-23283-1_8
fatcat:5ul6qpxssjfqjcygopi5z35jzm
Alan Turing and John von Neumann - Their Brains and Their Computers
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
As both Turing and von Neumann were interested in automata, and with their herculean zest for the hardest problems there are, they were mesmerized by one in particular: the brain. ...
Our paper is a call for the continuation of von Neumann's research program, to metaphorically put meat, or more decisively, muscle, on the skeleton of biological systems theory of today. ...
In the theory of formal languages and grammars, results outline in what conditions universality are possible in the field of context--free languages, of context--sensitive languages, of recursively enumerable ...
doi:10.1007/978-3-642-36751-9_2
fatcat:lsjeg25j2jegxcdmfjspufpn44
Subject Index to Volumes 1–75
2001
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
finding the convex hull, 512
linear algorithms, 505, 518, 1002, 1926, 2740, 3391
for edge coloring trees, 492
linear amortized time algorithms, 2716
linear and
bilinear arithmetic algorithms, 719 ...
, 30, 1609
solvability of
deadlock, 575
formal termination, 501
search problems, 1197
solvability of the
macro problem, 501
ranking problem, 1609
solvability
of word equations, 3020
proof, 501 ...
, 694 rank of a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245 ...
doi:10.1016/s0020-0190(01)00175-2
fatcat:5y67tfm6yfbblakrus5nnhs73e
A Christmas Chrestomathy
2021
Inference: International Review of Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
As it turned out, 2021 was a milestone year for the journal with the launch of a new website, the switch to a rolling publication schedule, and the debut of a new section: The Rambler. ...
As the year draws to a close, the editors are delighted to present our second annual Christmas Chrestomathy, highlighting the essays that best represent our aims, ambitions, attitudes, and even our animadversions ...
Having posed the problem, Chomsky also proposed its solution: The problem for the linguist, as well as for the child learning the language, is to determine from the data of performance the underlying system ...
doi:10.37282/991819.21.66
fatcat:jckdyzkhrvhsdov3bgr3dmlde4
Semiotics of the 20th century
2008
Sign Systems Studies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Semiotic and linguistic studies of the 20th century have been important mostly in two senses — (1) they have opened a road for comparative research on the origin and development of language and other systems ...
In the 21st century one may hope for closer integration of semiotics and exact and natural sciences. ...
Two most important examples of grammars in the history of linguistics are built for the languages following exact rules: Panini's Sanskrit grammar in ancient India and the Palais Royal grammar of French ...
doi:10.12697/sss.2008.36.1.10
fatcat:rvtqg37lcffnph3rbpgg3beu5y
Page 1570 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A note on grammatical inference of slender context-free languages. (English summary) 98f:68231
Tatar, Doina Logical grammars as grammatical view of logic programs. ...
(English summary) 981:68162
Satta, Giorgio The membership problem for unordered vector languages. ...
Tree Automata
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This is a reissue of the book Tree Automata by F. G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest. ...
Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references. ...
A language is right linear , or of type 3 (in the Chomsky hierarchy), if it can be generated by a right linear grammar. ...
arXiv:1509.06233v1
fatcat:ejhy6a7h2fcatcdfxv3hylresu
Page 1242 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(Chinese) 914:68070
Makinen, Erkki The grammatical inference problem for the Szilard languages of linear grammars. ...
Complexity of algorithmic problems of coding languages for various classes of coding mappings. ...
Page 1642 of Mathematical Reviews Vol. 31, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary)
Dassow, Jiirgen (with Mitrana, Victor, Paun, Gheorghe) Szilard languages associated to cooperating distributed grammar systems. ...
(English summary)
— (with Mitrana, Victor) The degree of parallelism in contextual grammars with the minimal competence strategy. ...
« Previous
Showing results 1 — 15 out of 29 results