Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages

DOI10.1109/TC.1981.1675797MaRDI QIDQ3914462zbMATH OpenOpenAlexFDO

Authors Patrick S. P. Wang

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

zbMATH Keywords

closure propertiesinstantaneous descriptionKleene's closurelanguage recognitiontwo-dimensional sequential/parallel matrix languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(2)

• Two-dimensional automata with rotated inputs (projection-type)
• A survey of two-dimensional automata theory

This page was built for publication: Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages

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