The Accepting Power of Finite Automata over Groups

Authors:
Victor Mitrana;Ralf Stiebe
Affiliations:
-;-
Venue:
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Year:
1997

Citing 0
Cited 6

Sequential grammars and automata with valances

Theoretical Computer Science
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group

Theoretical Computer Science
Word problems recognisable by deterministic blind monoid automata

Theoretical Computer Science
Semigroup automata with rational initial and terminal sets

Theoretical Computer Science
Generalized counters and reversal complexity

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Undecidability in Integer Weighted Finite Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract