default search action
Information and Computation, Volume 284
Volume 284, March 2022
- Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems (DCFS 2019). 104686 - Simon Beier, Markus Holzer:
Nondeterministic right one-way jumping finite automata. 104687 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of matrix simple semi-conditional grammars. 104688 - Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Maximal state complexity and generalized de Bruijn words. 104689 - Chris Keeler, Kai Salomaa:
Structural properties of NFAs and growth rates of nondeterminism measures. 104690 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional complexity of iterated uniform finite-state transducers. 104691 - Benedek Nagy:
Operational union-complexity. 104692 - Alexander Okhotin, Elizaveta Sazhneva:
State complexity of GF(2)-operations on unary languages. 104693 - Tomoyuki Yamakami:
How does adiabatic quantum computation fit into quantum automata theory? 104694
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.