A note on the space complexity of some decision problems for finite automata

Authors:
Tao Jiang;B. Ravikumar
Affiliations:
Department of Computer Science and Systems, McMaster University, Hamilton, Ontario, Canada L8S 4K1;Department of Computer Science and Statistics, University of Rhode Island, Kingston, R1 02881, USA
Venue:
Information Processing Letters
Year:
1991

Citing 14
Cited 19

A taxonomy of problems with fast parallel algorithms

Information and Control
The Boolean formula value problem is in ALOGTIME

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On a complexity hierarchy between L and NL

Information Processing Letters
Alternation with a pebble

Information Processing Letters
Alternation

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimal NFA Problems Are Hard

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P

ACM SIGACT News
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Space-bounded reducibility among combinatorial problems

Journal of Computer and System Sciences

An Improved Algorithm for the Membership Problem for Extended Regular Expressions

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Intersection of Regular Languages and Star Hierarchy

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Succinctness of Regular Expressions with Interleaving, Intersection and Counting

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Descriptional and Computational Complexity of Finite Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
LTL Path Checking Is Efficiently Parallelizable

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Local temporal logic is expressively complete for cograph dependence alphabets

Information and Computation
Bounded-variable fragments of hybrid logics

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Succinctness of regular expressions with interleaving, intersection and counting

Theoretical Computer Science
The complexity of regular(-like) expressions

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional and computational complexity of finite automata---A survey

Information and Computation
Unification in the description logic EL without the top concept

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Kleene theorems for product systems

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
A note on algebras of languages

Theoretical Computer Science
Succinctness of the Complement and Intersection of Regular Expressions

ACM Transactions on Computational Logic (TOCL)
Minimalizations of NFA using the universal automaton

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Similarity in languages and programs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note, we establish the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata. Our study includes 2-way infinite automata with a pebble.