Open AccessHigher-Order Pushdown Trees are Circularly Computable
Author(s) -
Jérôme Fortier
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - pushdown automaton , mathematical proof , coproduct , simple (philosophy) , automaton , computer science , tree automaton , embedded pushdown automaton , order (exchange) , discrete mathematics , process calculus , theoretical computer science , mathematics , algebra over a field , programming language , pure mathematics , parsing , context free grammar , finance , economics , tree adjoining grammar , philosophy , geometry , epistemology