Nested Stack Automata

A formal model for context-free languages augmented with reduplication

Computational Linguistics

CONS should not CONS its arguments, or, a lazy alloc is a smart alloc

ACM SIGPLAN Notices

A Grammatical Characterization of One-Way Nondeterministic Stack Languages

Journal of the ACM (JACM)

Multitape AFA

Journal of the ACM (JACM)

On Equivalence and Containment Problems for Formal Languages

Journal of the ACM (JACM)

Stack Machines and Classes of Nonnested Macro Languages

Journal of the ACM (JACM)

On the complexity of grammar and related problems

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Computational parallels between the regular and context-free languages

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Some restrictions on W-grammars

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Iterated pushdown automata and complexity classes

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Chinese number-names, tree adjoining languages, and mild context-sensitivity

Computational Linguistics

New frontiers beyond context-freeness: DI-grammars and DI-automata

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics

Model-Checking Games for Typed λ-Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)

Abstract families of relations

Journal of Computer and System Sciences

Two-way nested stack automata are equivalent to two-way stack automata

Journal of Computer and System Sciences

A generalized approach to formal languages

Journal of Computer and System Sciences

Gaining power by input operations: finite automata and beyond

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata

Regular sets over extended tree structures

Theoretical Computer Science

Regular sets of higher-order pushdown stacks

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Input reversals and iterated pushdown automata: a new characterization of khabbaz geometric hierarchy of languages

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Second-order simple grammars

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Dense completeness

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae

Sequences of level 1, 2, 3,..., k,...

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications