FINITE AUTOMATA OVER FREE GROUPS-Reference-Cited by-同舟云学术

FINITE AUTOMATA OVER FREE GROUPS

Published:2000-12 Issue:06 Volume:10 Page:725-737
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

DASSOW JÜRGEN¹,MITRANA VICTOR²

Affiliation:

1. Otto-von-Guericke-Universität Magdeburg, Fakultat für Informatik PF 4120, D-39016, Magdeburg, Germany

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

Abstract

Finite automata are extended by adding an element of a given group to each of their configurations. An input string is accepted if and only if the neutral element of the group is associated to a final configuration reached by the automaton. We get a new characterization of the context-free languages as soon as the considered group is the binary free group. The result cannot be carried out in the deterministic case. Some remarks about finite automata over other groups are also presented.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196700000315

Reference3 articles.

1. Remarks on blind and partially blind one-way multicounter machines

2. Finite automata with multiplication

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Degree of Extension of Some Models Defining Non-Regular Languages;Electronic Proceedings in Theoretical Computer Science;2023-09-03

2. Groups Whose Word Problems Are Accepted by Abelian $$G$$-Automata;Developments in Language Theory;2023

3. On the group memory complexity of extended finite automata over groups;Journal of Logical and Algebraic Methods in Programming;2020-12

4. New Results on Vector and Homing Vector Automata;International Journal of Foundations of Computer Science;2019-12

5. Language classes associated with automata over matrix groups;RAIRO - Theoretical Informatics and Applications;2018-04