#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2001

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andris Ambainis, Arnolds Kikusts, Maris Valdats
- STACS
- 2001

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages… (More)

- Maris Valdats
- DCFS
- 2011

- Maris Valdats
- AFL
- 2014

In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ exponentially. In some cases minimization of DFA can lead to an exponential increase in BC-complexity, on the other hand… (More)

- ‹
- 1
- ›