Solvable problems for transformers with reversal-bounded counters
From MaRDI portal
Publication:3747751
DOI10.1007/BF01078820zbMath0608.68067MaRDI QIDQ3747751
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01078820
equivalence problem; functional equivalence; two-way deterministic finite automata; finite transformers with reversal-bounded counters; linearly rigid semigroup; nonemptiness of a recognizable language; transformers on marked trees
Related Items
Cites Work