Bounded-crossing transducers

DOI10.1016/S0019-9958(75)90159-XMaRDI QIDQ4051638zbMATH OpenFDO

Authors Vaclav Rajlich

Publication date 1975

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(75)90159-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(6)

• 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
• On the descriptional complexity of stateless deterministic ordered restarting automata
• scientific article; zbMATH DE number 3604381 (Why is no real title available?)

This page was built for publication: Bounded-crossing transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051638)