Cybernetics and Systems Analysis

, Volume 32, Issue 2, pp 299–301 | Cite as

Recognition of perfect labeled trees with regularity condition

  • L. P. Lisovik
Brief Communications


Operating System Artificial Intelligence System Theory Regularity Condition Label Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. P. Lisovik, “On the equivalence problem for transducers on Σ-trees with finite-return counters,” Kibernetika, No. 5, 19–24 (1984).MATHMathSciNetGoogle Scholar
  2. 2.
    A. V. Aho, “Indexed grammars — an extension of context-free grammars,” J. ACM,15, 647–671 (1968).CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • L. P. Lisovik

There are no affiliations available

Personalised recommendations