On the Myhill-Nerode Theorem for Trees

Abstract

This result generalizes in a straightforward way to automata on finite trees. I rediscovered this generalization in connection with work on finitely presented algebras, and stated it without proof or attribution in [7, 8], being at that time under the impression that it was folklore and completely elementary. It was again rediscovered independently by Z. Fulop and S. Vagvolgyi and reported in a recent contribution to this Bulletin. In that paper they attribute the result to me.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1992
Accession Number
AD1007848

Entities

People

  • Dexter Kozen

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Alphabets
  • Automata
  • Automata Theory
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Formal Languages
  • Language
  • Machines
  • Military Research
  • New York
  • Theoretical Computer Science
  • Transitions
  • Universities

Readers

  • Educational Psychology
  • Mathematical Modeling and Probability Theory.
  • Mycotoxin ecology in Amazonian ecosystems.