z-logo
open-access-imgOpen Access
Ordered Tree-Pushdown Systems
Author(s) -
Lorenzo Clemente,
Paweł Parys,
Sylvain Salvati,
Igor Walukiewicz
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - embedded pushdown automaton , reachability , pushdown automaton , deterministic pushdown automaton , reachability problem , computer science , decidability , deterministic context free grammar , theoretical computer science , simple (philosophy) , class (philosophy) , discrete mathematics , mathematics , automaton , programming language , context free grammar , artificial intelligence , parsing , tree adjoining grammar , automata theory , philosophy , epistemology , nondeterministic finite automaton

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom