Unary Pushdown Automata and Straight-Line Programs
From MaRDI portal
Publication:5167834
DOI10.1007/978-3-662-43951-7_13zbMath1409.68156arXiv1403.0509OpenAlexW29384094MaRDI QIDQ5167834
Rupak Majumdar, Dmitry Chistikov
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.0509
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Context-free commutative grammars with integer counters and resets ⋮ Language equivalence of probabilistic pushdown automata ⋮ Unnamed Item
This page was built for publication: Unary Pushdown Automata and Straight-Line Programs
