Descriptional complexity of unambiguous input-driven pushdown automata (Q484313): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6383893
@@ Property / zbMATH DE Number: 6383893 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nondeterminism
@@ Property / zbMATH Keywords: nondeterminism / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+unambiguity
@@ Property / zbMATH Keywords: unambiguity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+input-driven pushdown automata
@@ Property / zbMATH Keywords: input-driven pushdown automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+visibly pushdown automata
@@ Property / zbMATH Keywords: visibly pushdown automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nested word automata
@@ Property / zbMATH Keywords: nested word automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+descriptional complexity
@@ Property / zbMATH Keywords: descriptional complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2014.11.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2079567772
@@ Property / OpenAlex ID: W2079567772 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:484313