Skip to search formSkip to main contentSkip to account menu

Markov algorithm

Known as: Markov algorithms, Markov's algorithms, Markow algorithm 
In theoretical computer science, a Markov algorithm is a string rewriting system that uses grammar-like rules to operate on strings of symbols… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Automata-based programmingChurch–Turing thesisComputabilityComputation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Information fusion for object & situation assessment in sensor networks
A semantic framework for information fusion in sensor networks for object and situation assessment is proposed. The overall… 
2010
2010
Bacterial Foraging Algorithm with Adaptable Chemotactic Step Size
This paper presents development of a new approach involving adaptable chemotactic step size in bacterial foraging algorithm (BFA… 
2008
2008
The development of modeling or the modeling of development?
Abstract We agree with many theoretical points presented by Rogers & McClelland (R&M), especially the role of domain-general… 
2000
2000
Time-recursive maximum likelihood based sequence estimation for unknown ISI channels
In this paper MLSE (maximum likelihood sequence estimation) is applied to unknown ISI (inter-symbol interference) fast time… 
2000
2000
Noise-compensated hidden Markov models
The technique of hidden Markov models has been established as one of the most successful methods applied to the problem of speech… 
1998
1998
Incremental language learning: two and three year olds' acquisition of adjectives
Prior research reports that children up to 3-years-old map n ovel adjectives to object properties only in very limited situat… 
1993
1993
A Synthesis of Type-Checking and Parsing
1991
1991
Formal Languages and Power Series
  • A. Salomaa
  • Handbook of Theoretical Computer Science, Volume…
  • 1991
  • Corpus ID: 35545460
1975
1975
The general decision problem for Markov algorithms with axiom
  • C. Hughes
  • Notre Dame J. Formal Log.
  • 1975
  • Corpus ID: 13554858
Introduction* Let Mj denote the general decision problem for Markov algorithms with axiom. Of interest to us is whether or not… 
1972
1972
Combinatorial Systems. I. Cylindrical Problems
  • J. Cleave
  • Journal of computer and system sciences (Print)
  • 1972
  • Corpus ID: 26462213
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)