On NFAs where all states are final, initial, or both

Authors:
Jui-Yi Kao;Narad Rampersad;Jeffrey Shallit
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
Theoretical Computer Science
Year:
2009

Citing 12
Cited 8

Partial orders on words, minimal elements of regular languages, and state complexity

Theoretical Computer Science
Introduction to the Theory of Computation: Preliminary Edition

Introduction to the Theory of Computation: Preliminary Edition
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Nondeterminism and the size of two way finite automata

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
State complexity of some operations on binary regular languages

Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Multiple-entry finite automata

Journal of Computer and System Sciences

State complexity of prefix, suffix, bifix and infix operators on regular languages

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Automata with extremal minimality conditions

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
Decision problems for convex languages

Information and Computation
Quotient complexity of closed languages

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Quotient Complexity of Closed Languages

Theory of Computing Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.