Cybernetics and Systems Analysis

, Volume 34, Issue 4, pp 540–544 | Cite as

Parallelization of automata

  • Yu. G. Shukuryan
Cybernetics
Received:
  • 15 Downloads

Keywords

Normal Form Polynomial Time Finite Automaton Linear Section Trace Length 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Diekert, “Combinatorics on traces,“ LNCS,454, 1–165 (1990).Google Scholar
  2. 2.
    A. A. Letichevskii, “Equivalence of automata with respect to semigroups with cancellation,“ Probl. Kibern., No. 27, 195–212 (1973).Google Scholar
  3. 3.
    V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,“ in: Selected Topics in Algebra and Logic [in Russian], Nauka, Novosibirsk (1973), pp. 5–39.Google Scholar
  4. 4.
    Yu. G. Shukuryan, “Trace parallelization in free partially commutative semigroups,“ Dokl. Akad Nauk Arm., No. 5, 289–293 (1993).Google Scholar
  5. 5.
    M. Gary and M. Johnson, Computers and Intractability [Russian translation], Mir, Moscow (1982).Google Scholar
  6. 6.
    J. D. Ullman, “NP-complete scheduling problems,“ JCSS,10, 384–393 (1975).MATHGoogle Scholar
  7. 7.
    A. Aho, J. Hopcroft, and J. Ullman, Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).Google Scholar

Copyright information

© Kluwer Academic/Plenum Publishers 1999

Authors and Affiliations

  • Yu. G. Shukuryan

There are no affiliations available

Personalised recommendations