Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
From MaRDI portal
Publication:3914462
DOI10.1109/TC.1981.1675797zbMath0463.68074MaRDI QIDQ3914462
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
closure properties; language recognition; instantaneous description; Kleene's closure; two-dimensional sequential/parallel matrix languages
68Q45: Formal languages and automata
Related Items
Two-dimensional automata with rotated inputs (projection-type), A survey of two-dimensional automata theory