![Finite automata / Formal languages / Regular language / Constructible universe / Tree automaton / Quantum finite automata Finite automata / Formal languages / Regular language / Constructible universe / Tree automaton / Quantum finite automata](https://www.pdfsearch.io/img/ee6a33fa0931acf056682ffb918273b6.jpg) Date: 2010-12-13 12:13:48Finite 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 2Add to Reading ListSource URL: drops.dagstuhl.deDownload Document from Source Website File Size: 742,09 KBShare Document on Facebook
|