Skip to main content
SpringerLink
Log in

The accepting power of finite automata over groups

  • 1. Regulated Rewriting
  • Chapter
  • First Online:
New Trends in Formal Languages

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1218))

Abstract

Some results from [2], [5], [6] are generalized for finite automata over arbitrary groups. The accepting power is smaller when abelian groups are considered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a finite automaton over an abelian group is actually a unordered vector language. Finally, deterministic finite automata over groups are investigated.

Work supported by the Alexander von Humboldt Foundation and the Academy of Finland, Project 11281

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Akademie-Verlag, Berlin, 1989.

    Google Scholar 

  2. J. Dassow, V. Mitrana, Finite automata over free generated groups, submitted, 1996.

    Google Scholar 

  3. S. Ginsburg, S. A. Greibach, Abstract families of languages. Memoirs Amer. Math. Soc. 87(1969), 1–32.

    Google Scholar 

  4. S. Ginsburg, Algebraic and automata-theoretic properties of formal languages, North-Holl., Amsterdam, Oxford, 1975.

    Google Scholar 

  5. S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines. Th. Comp. Sci. 7(1978), 311–324.

    Google Scholar 

  6. O. H. Ibarra, S. K. Sahni, C. E. Kim, Finite automata with multiplication. Th. Comp. Sci., 2(1976), 271–294.

    Google Scholar 

  7. Gh. Păun, A new generative device: valence grammars, Rev. Roum. Math. Pures et Appl., 25, 6(1980), 911–924.

    Google Scholar 

  8. J. J. Rotman, An Introduction to the Theory of Groups, Springer-Verlag, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  2. Faculty of Computer Science, University of Magdeburg, P.O.Box 4120, D-39016, Magdeburg, Germany

    Ralf Stiebe

Authors
  1. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Stiebe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mitrana, V., Stiebe, R. (1997). The accepting power of finite automata over groups. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation