Multitape AFA

DOI10.1145/321694.321695zbMath0241.68031OpenAlexW2295419245MaRDI QIDQ5652213

Seymour Ginsburg, Sheila A. Greibach

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321694.321695

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (16)

Unnamed Item ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reset machines ⋮ The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors ⋮ Deterministic multitape automata computations ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Multiple equality sets and Post machines ⋮ Reversal-bounded multipushdown machines ⋮ Uniformly erasable AFL ⋮ Bounded AFLs ⋮ Control sets on context-free grammar forms ⋮ Classes of formal grammars ⋮ Remarks on blind and partially blind one-way multicounter machines ⋮ Syntactic operators on full semiAFLs

This page was built for publication: Multitape AFA