1 citations · 1 across the 3 of their papers we have counts for
5 papers
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…
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…
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…
Machine Learning by Adiabatic Evolutionary Quantum System
Tomoyuki Yamakami
A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying in…
When Input Integers are Given in the Unary Numeral Representation
Tomoyuki Yamakami
Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral repres…