1 citations · 1 across the 3 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
Full AFLs Closed under Nested Iterated -Variate Substitution and Depth-k Storage Automata
Tomoyuki Yamakami
Greibach and Ginsburg (1969) studied abstract families of languages or AFLs. A full AFL is a class of languages closed under the following operations: homomorphism, inverse homomor…
cs.FL2026
Semi-Linearity and Generalized Stratified Semi-Linearity beyond Context-Free Languages
Tomoyuki Yamakami
Parikh's famous theorem relates to the semi-linearity of context-free languages. We seek for expanding the scope of the semi-linear property from context-free languages to language…
cs.FL2026
How Can Size and Ceiling Bounds Affect the Complexity of Nonuniform Automata Families?
Tomoyuki Yamakami
In the past literature, families of two-way finite automata and pushdown automata having limited state complexity (i.e., the total number of inner states) and stack-state complexit…