ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The notion of a probabilistic cellular acceptor (1979)
    Springer
    International journal of parallel programming 8 (1979), S. 181-208 
    Details
    ISSN: 1573-7640
    Keywords: Model ; unreliability ; parallelism ; probabilistic ; cellular ; automaton ; acceptor ; language ; cut point ; decision cell
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The combination of the notions of a cellular automaton and a probabilistic automaton, called a probabilistic cellular automaton, was proposed in 1973 by the first author of this paper as a more adequate model of any system with unreliable components that operate in a parallel manner. In this paper a language-acceptor type of such a probabilistic cellular automaton, called aprobabilistic bounded cellular acceptor (PBCA), is defined and studied. It is shown that the class of all languages accepted by one-dimensional PBCAs includes both the class of all languages accepted by bounded cellular acceptors (BCAs) and the class of all languages accepted by probabilistic acceptors (PAs). Also, it is shown that every language accepted by ad-dimensional PBCA at a given cut point is accepted by ad-dimensional PBCA at an arbitrary nonzero cut point. The class of all languages accepted by one-dimensional PBCAs at cut point 0 is shown to be precisely the class of all context-sensitive languages. Several decision problems for PBCAs are shown to be recursively unsolvable. Finally, various open problems concerning PBCAs and PBCLs are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00977787
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Statistical inference in mathematical and computational linguistics (1977)
    Springer
    International journal of parallel programming 6 (1977), S. 95-129 
    Details
    ISSN: 1573-7640
    Keywords: Modeling ; computers ; Markov chains ; information theory ; entropy ; redundancy ; style indices ; authorship tests ; type-token relations ; vocabulary richness ; Zipf-Joos-Mandelbrot laws ; gap analysis ; glottochronology
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The status of certain problems of statistical inference that have been encountered in mathematical and computational linguistics is described. Underlying statistical theory and techniques are illustrated by a variety of examples from structural, comparative, and historical linguistics. Concurrently, the relationships of some theoretical issues in statistical linguistics to practical matters in computational linguistics are briefly treated. Also, several areas in mathematical and computational linguistics of promising research interest for computer or information scientists are noted. Finally, the need for more interdisciplinary studies involving computer scientists, linguists, and mathematicians is pointed out.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00999301
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...