<--- Back to Details
First PageDocument Content
Finite automata / Formal languages / Regular language / Constructible universe / Tree automaton / Quantum finite automata
Date: 2010-12-13 12:13:48
Finite automata
Formal languages
Regular language
Constructible universe
Tree automaton
Quantum finite automata

Average Analysis of Glushkov Automata under a BST-Like Model Cyril Nicaud1 , Carine Pivoteau1 , and Benoît Razet2 1 2

Add to Reading List

Source URL: drops.dagstuhl.de

Download Document from Source Website

File Size: 742,09 KB

Share Document on Facebook

Similar Documents