Bounded-crossing transducers
From MaRDI portal
Publication:4051638
DOI10.1016/S0019-9958(75)90159-XzbMath0297.68069MaRDI QIDQ4051638
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index, Tree transducers, L systems, and two-way machines, The halting problem for linear Turing assemblers, One way finite visit automata, Unnamed Item