Quasimorphisms or Queasymorphisms? Modeling Finite Automaton Environments

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Foundations of Genetic Algorithms

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/b978-0-08-050684-5.50012-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An automaton decomposition for learning system environments

  1988cited by this paper
• A Reward Scheme for Production Systems with Overlapping Conflict Sets

  1986cited by this paper
• Toward a Formal Theory of Modeling and Simulation: Structure Preserving Morphisms

  1972cited by this paper

• Foundations of Learning Classifier Systems

  2005cites this paper
• Foundations of learning classifier systems: An introduction

  2005cites this paper
• Learning Classifier Systems, 5th International Workshop, IWLCS 2002, Granada, Spain, September 7-8, 2002, Revised Papers

  2003cites this paper
• Minimality of an Automaton Cascade Decomposition for Learning System Environments

  2002cites this paper
• The 2003 Learning Classifier Systems Bibliography

  2002cites this paper
• Local Reinforcement and Recombination in Classifier Systems

  2001cites this paper
• A Bigger Learning Classifier Systems Bibliography

  2000cites this paper
• A Learning Classifier Systems Bibliography

  1999cites this paper
• An approach to credit assignment in classifier systems

  1998cites this paper
• A Reinforcement Learning Method for Maximizing Undiscounted Rewards

  1993cites this paper