Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
From MaRDI portal
Publication:3914462
DOI10.1109/TC.1981.1675797zbMath0463.68074OpenAlexW2033228010MaRDI QIDQ3914462
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1981.1675797
closure propertieslanguage recognitioninstantaneous descriptionKleene's closuretwo-dimensional sequential/parallel matrix languages
Related Items
A survey of two-dimensional automata theory ⋮ Two-dimensional automata with rotated inputs (projection-type)