The tree width of an alternating finite automaton (AFA) measures the parallelism in all computations AFA on a given input. maximal existential (respectively, universal) A string w number choices parallel universal branches) one computation w. We give polynomial time algorithms deciding finiteness AFA’s and width. Also we algorithm that for with decides whether or not is finite. Finiteness decid...

Children are sensitive to syntactic structure when learning new verbs (Gleitman 1990). This has been shown in tracking transitivity (Naigles 1990), as well hypothesizing meanings for attitude (Harrigan et al 2019). In English, desire and belief subcategories of have different finiteness properties; occur with finite complements non-finite complements. The current study explores adults’ sensitiv...

We consider the Riemann Mapping Theorem in the case of a bounded simply connected and semianalytic domain. We show that the germ at 0 of the Riemann map (i.e. bihilomorphic map) from the upper half plane to such a domain can be realized in a certain quasianalytic class used by Ilyashenko in his work on Hilbert’s 16 problem if the angle of the domain at the boundary point to which 0 is mapped, i...