Nondeterminism and Boolean operations in pda's

DOI10.1016/0022-0000(78)90030-2zbMath0376.68052OpenAlexW2089709194MaRDI QIDQ1245576

Detlef Wotschke

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90030-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (9)

Conjunctive grammars and alternating pushdown automata ⋮ LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA ⋮ The Boolean closure of linear context-free languages ⋮ Kernels of Sub-classes of Context-Free Languages ⋮ LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata ⋮ Intersections de langages algébriques bornes ⋮ NOTES ON DUAL CONCATENATION ⋮ Computation with multiple CTCs of fixed length and width ⋮ Boolean kernels of context-free languages

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• Deterministic Pushdown Store Machines and Real-Time Computation
• A Class of Projective Planes
• Deterministic context free languages
• An infinite hierarchy of intersections of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nondeterminism and Boolean operations in pda's