Pictures of functions and their acceptability by automata

DOI10.1016/0304-3975(88)90007-2zbMath0504.68027OpenAlexW2086160022MaRDI QIDQ1836301

Yanyan Li

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90007-2

zbMATH Keywords

Turing machinenondeterministic automatoncomputable functionthree-dimensional automaton

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

Infinite arrays and infinite computations ⋮ Infinite arrays and controlled deterministic table 0L array systems

Cites Work

• Unnamed Item
• Theories of automata on \(\omega\)-tapes: a simplified approach
• On causal \(\omega^2\)-systems
• Some properties of two-dimensional on-line tessellation acceptors

This page was built for publication: Pictures of functions and their acceptability by automata