FINITE AUTOMATA OVER FREE GROUPS
From MaRDI portal
Publication:2709977
DOI10.1142/S0218196700000315zbMath0969.68093OpenAlexW2031673250MaRDI QIDQ2709977
Victor Mitrana, Juergen Dassow
Publication date: 17 April 2001
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196700000315
Related Items (10)
On groups whose word problem is solved by a counter automaton. ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Homing vector automata ⋮ Unnamed Item ⋮ On the group memory complexity of extended finite automata over groups ⋮ Word problems recognisable by deterministic blind monoid automata ⋮ New Results on Vector and Homing Vector Automata ⋮ On the sentence valuation in a semiring ⋮ Language classes associated with automata over matrix groups
Cites Work
This page was built for publication: FINITE AUTOMATA OVER FREE GROUPS
