Minicomplexity-Reference-Cited by-同舟云学术

Minicomplexity

Published:2012 Issue: Volume: Page:20-42
ISSN:0302-9743
Container-title:Descriptional Complexity of Formal Systems
language:
Short-container-title:

Author:

Kapoutsis Christos A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31623-4_2.pdf

Reference31 articles.

1. Barnes, B.H.: A two-way automaton with fewer states than any equivalent one-way automaton. IEEE Transactions on Computers C-20(4), 474–475 (1971)

2. Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Report 304, Institute of Computer Science, Polish Academy of Sciences, Warsaw (1977)

3. Birget, J.C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory 29, 191–226 (1996)

4. Geffert, V.: An alternating hierarchy for finite automata. Theoretical Computer Science (to appear)

5. Lecture Notes in Computer Science;V. Geffert,2012

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata;Fundamentals of Computation Theory;2023

2. Two-Way Non-Uniform Finite Automata;International Journal of Foundations of Computer Science;2022-12-12

3. Improved complement for two-way alternating automata;Acta Informatica;2022-01-21

4. Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice;Information and Computation;2021-06

5. Two-Way Non-uniform Finite Automata;Developments in Language Theory;2021