Advertisement

Stable finite automata mappings and Church-Rosser systems

  • A. V. Anisimov
  • V. A. Oleshchuk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Keywords

Transitive Closure Regular Language Finite Automaton Commutative Semigroup Inclusion Problem 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anisimov A.V. Semigroup finite automata mappings.—Kibernetica, 1981, n.5, p. 1–7.Google Scholar
  2. 2.
    Glushkov V.M., Anisimov A.V. Church-Rosser transducers.—Kibernetica, 1979, n.5, p. 1–8.Google Scholar
  3. 3.
    Jantzen M. Thue systems and Church-Rosser property.—Lect. Notes Comp. Sci., 1984, vol.176, p.80–95.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • A. V. Anisimov
    • 1
  • V. A. Oleshchuk
    • 1
  1. 1.Department of CyberneticsKiev State UniversityKiev-17U.S.S.R.

Personalised recommendations