On the State Complexity of Operations on Two-Way Finite Automata-Reference-Cited by-同舟云学术

On the State Complexity of Operations on Two-Way Finite Automata

Published: Issue: Volume: Page:443-454
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Jirásková Galina,Okhotin Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85780-8_35.pdf

Reference14 articles.

1. Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoretical Computer Science 119, 267–291 (1993)

2. Domaratzki, M., Okhotin, A.: State complexity of power, TUCS Technical Report No 845, Turku Centre for Computer Science, Turku, Finland (January 2007)

3. Geffert, V.: Nondeterministic computations in sublogarithmic space and space constructibility. SIAM Journal on Computing 20(3), 484–498 (1991)

4. Geffert, V.: Personal communication (March 2008)

5. Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Information and Computation 205(8), 1173–1187 (2007)

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

1. Cellular Automata: Descriptional Complexity and Decidability;Reversibility and Universality;2018

2. On the state complexity of operations on two-way finite automata;Information and Computation;2017-04

3. Investigations on Automata and Languages Over a Unary Alphabet;International Journal of Foundations of Computer Science;2015-11

4. Complexity of Operation Problems;Language, Life, Limits;2014

5. State complexity of operations on two-way finite automata over a unary alphabet;Theoretical Computer Science;2012-08