Intersection and union hierarchies of deterministic context-free languages and pumping lemmas

DOI10.1007/978-3-030-40608-0_24zbMath1437.68108arXiv2112.09383OpenAlexW3006766709MaRDI QIDQ782591

Tomoyuki Yamakami

Publication date: 27 July 2020

Full work available at URL: https://arxiv.org/abs/2112.09383

zbMATH Keywords

pumping lemmadeterministic pushdown automataintersection and union hierarchieslimited automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata ⋮ Formal grammars for turn-bounded deterministic context-free languages ⋮ Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract)

This page was built for publication: Intersection and union hierarchies of deterministic context-free languages and pumping lemmas