Pages that link to "Item:Q1244324"
From MaRDI portal
The following pages link to Some properties of two-dimensional on-line tessellation acceptors (Q1244324):
Displayed 50 items.
- A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines (Q593784) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- A note on bottom-up pyramid acceptors (Q755297) (← links)
- Two-dimensional alternative Turing machines (Q794169) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- A note on time-bounded bottom-up pyramid cellular acceptors (Q918727) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Characterizations of recognizable picture series (Q1022605) (← links)
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors (Q1054480) (← links)
- Two-dimensional automata with rotated inputs (projection-type) (Q1062451) (← links)
- Three-way two-dimensional finite automata with rotated inputs (Q1077165) (← links)
- A hierarchy of random-context grammars and automata (Q1091151) (← links)
- A note on three-way two dimensional alternating Turing machines (Q1112612) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines (Q1140989) (← links)
- Cyclic closure properties of automata on a two-dimensional tape (Q1140990) (← links)
- Three-way tape-bounded two-dimensional Turing machines (Q1143793) (← links)
- Three-way two-dimensional multicounter automata (Q1143796) (← links)
- Real-time recognition of two-dimensional tapes by cellular automata (Q1143799) (← links)
- A remark on two-dimensional finite automata (Q1146011) (← links)
- A note on deterministic three-way tape-bounded two-dimensional Turing machines (Q1148677) (← links)
- Two-dimensional automata with rotated inputs (Q1148678) (← links)
- Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure (Q1148679) (← links)
- A note on rebound automata (Q1162823) (← links)
- A note on three-dimensional finite automata (Q1164425) (← links)
- Two-dimensional on-line tessellation acceptors are not closed under complement (Q1193695) (← links)
- Three-dimensional connected pictures are not recognizable by finite-state acceptors (Q1205515) (← links)
- A note on two-dimensional finite automata (Q1245102) (← links)
- Two-dimensional cellular automata recognizer (Q1292301) (← links)
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\) (Q1310925) (← links)
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata (Q1318689) (← links)
- Context-sensitive string languages and recognizable picture languages (Q1376420) (← links)
- Recognizable picture languages and domino tiling (Q1391540) (← links)
- Two-dimensional cellular automata and deterministic on-line tessalation automata (Q1399986) (← links)
- Two-dimensional connected pictures are not recognizable by finite-state acceptors (Q1803862) (← links)
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation (Q1822982) (← links)
- Pictures of functions and their acceptability by automata (Q1836301) (← links)
- EMSO-logic and automata related to homogeneous flow event structures (Q1885039) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Two-dimensional models (Q2074211) (← links)
- A Nivat theorem for weighted picture automata and weighted MSO logics (Q2424674) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- Weighted picture automata and weighted logics (Q2429722) (← links)
- A SAT-based parser and completer for pictures specified by tiling (Q2459547) (← links)
- Tile rewriting grammars and picture languages (Q2484438) (← links)
- New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
- Three-way two-dimensional alternating finite automata with rotated inputs (Q2489224) (← links)
- Picture languages: tiling systems versus tile rewriting grammars. (Q2490811) (← links)