K. Inoue and A. Nakamura, \Some properties of two-dimensional on-line tesselation acceptors." Information Sciences 13 (1977) 95-121. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
.... of languages de nable with a two dimensional analog of regular expressions, with horizontal and vertical versions of concatenation and the operator [15] they also show that h(LLL) s are exactly the languages de nable with existential monadic secondorder formulas [14] Inoue and Nakamura [26] also de ned a class equivalent to h(LLL) s, the non deterministic on line tesselation acceptors. 2.6 Closure properties One of the most basic questions we can ask about a class C of languages is whether it is closed under various operations: for instance, for two languages L 1 ; L 2 2 C, are L ....
K. Inoue and A. Nakamura, \Some properties of two-dimensional on-line tesselation acceptors." Information Sciences 13 (1977) 95-121.
Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore (Correct)
.... subblocks and then project onto a smaller alphabet, obtaining a class of picture languages which we call homomorphisms of local lattice languages, or h(LLL)s [8] These are also called the recognizable languages [3] or the languages recognizable by non deterministic online tesselation acceptors [5]. While DFAs, NFAs and h(LLL)s are equivalent in one dimension, in two or more they become distinct: DFA # NFA # h(LLL) where these inclusions are strict. Reviews of these classes are given in [8, 4, 7, 11] and a bibliography of papers in the subject is maintained by Borchert at [2] A ....
K. Inoue and A. Nakamura (1977) Some properties of two-dimensional on-line tesselation acceptors. Information Sciences 13 95--121.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
....n b n g is not regular, this h(LLL) is not NFA. Our lemma regarding an NFA s excursions off a n Theta 1 strip appears to be new; it is an open question whether this can be extended to excursions outside an m Theta n rectangle [46] A different example of an h(LLL) that is not NFA is given in [23]. We can now summarize our results by saying LLL ae DFA ae NFA ae h(LLL) with each inclusion proper in d 2. There are many interesting examples of h(LLL) s; here are some of our favorites. 1. Two dimensional L systems, produced by some expansion rule. L systems [28] are languages generated by ....
....configuration, and h leaves just the couplings visible. We discuss NP completeness, and analogous results for DFA s and NFA s, further in Section 2.8. We note in conclusion that h(LLL) s are equivalent to another model mentioned in the literature, non deterministic on line tesselation acceptors [23]. But we feel this formulation is considerably more elegant. 2.6 Closure properties One of the most basic questions we can ask about a class C of languages is whether it is closed under various operations: for instance, for two languages L 1 ; L 2 2 C, are L 1 L 2 , L 1 [ L 2 , or L 1 also in ....
K. Inoue and A. Nakamura, "Some properties of two-dimensional on-line tesselation acceptors." Information Sciences 13 (1977) 95--121.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC