Transition function complexity of finite automata

Authors:
Maris Valdats
Affiliations:
University of Latvia, Faculty of Computing, Latvia
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 6
Cited 0

Finite automata, formal logic, and circuit complexity

Finite automata, formal logic, and circuit complexity
Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
An n log n algorithm for minimizing states in a finite automaton

An n log n algorithm for minimizing states in a finite automaton
Minimizing NFA's and regular expressions

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.