<--- Back to Details
First PageDocument Content
Finite automata / Tree automaton / Tree / Formal languages / Model checking
Date: 2014-10-12 12:01:50
Finite automata
Tree automaton
Tree
Formal languages
Model checking

Add to Reading List

Source URL: akira.ruc.dk

Download Document from Source Website

File Size: 716,27 KB

Share Document on Facebook

Similar Documents

Formal languages / Grammar / Language / Cognitive science / Formal grammar / Context-sensitive grammar / Tree-adjoining grammar / Context-free grammar / Regular tree grammar / Tree automaton / Regular language / Graph rewriting

24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)

DocID: 1rsDZ - View Document

Formal languages / Tree automaton / Binary tree / Tree / Regular tree grammar / Parity / Alphabet / Arity / Even

Foundations of XML Types: Tree Automata Pierre Genevès CNRS (slides mostly based on slides by W. Martens and T. Schwentick) University of Grenoble Alpes, 2015–2016

DocID: 1oS7V - View Document

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

DocID: 1nGg0 - View Document

Models of computation / Formal languages / Pushdown automaton / Finite automata / Nondeterministic finite automaton / Computability / Abstract interpretation / Context-free language / Symbol / Nested stack automaton / Tree stack automaton

JFP): 218–283, c Cambridge University Press 2014 ⃝ 218

DocID: 1lF8p - View Document

Finite automata / Tree automaton / Tree / Formal languages / Model checking

PDF Document

DocID: 1iNRf - View Document