Convergence and Diversity in the Control Hierarchy

by   Alexandra Butoi, et al.

Weir has defined a hierarchy of language classes whose second member (ℒ_2) is generated by tree-adjoining grammars (TAG), linear indexed grammars (LIG), combinatory categorial grammars, and head grammars. The hierarchy is obtained using the mechanism of control, and ℒ_2 is obtained using a context-free grammar (CFG) whose derivations are controlled by another CFG. We adapt Weir's definition of a controllable CFG to give a definition of controllable pushdown automata (PDAs). This yields three new characterizations of ℒ_2 as the class of languages generated by PDAs controlling PDAs, PDAs controlling CFGs, and CFGs controlling PDAs. We show that these four formalisms are not only weakly equivalent but equivalent in a stricter sense that we call d-weak equivalence. Furthermore, using an even stricter notion of equivalence called d-strong equivalence, we make precise the intuition that a CFG controlling a CFG is a TAG, a PDA controlling a PDA is an embedded PDA, and a PDA controlling a CFG is a LIG. The fourth member of this family, a CFG controlling a PDA, does not correspond to any formalism we know of, so we invent one and call it a Pushdown Adjoining Automaton.


page 1

page 2

page 3

page 4


Weak equivalence of higher-dimensional automata

This paper introduces a notion of weak equivalence for higher-dimensiona...

On the binomial equivalence classes of finite words

Two finite words u and v are k-binomially equivalent if, for each word x...

Strong Equivalence of TAG and CCG

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) ar...

Bounding the FDP in competition-based control of the FDR

Competition-based approach to controlling the false discovery rate (FDR)...

Intensional Constructed Numbers: Towards Formalizing the Notion of Algorithm

This work is meant to be a step towards the formal definition of the not...

Why the equivalence problem for unambiguous grammars has not been solved back in 1966?

In 1966, Semenov, by using a technique based on power series, suggested ...

After 100 Years, Can We Finally Crack Post's Problem of Tag? A Story of Computational Irreducibility, and More

Empirical, theoretical and historical aspects of Post's "problem of tag"...

Please sign up or login with your details

Forgot password? Click here to reset