Descriptional complexity of unambiguous input-driven pushdown automata (Q484313): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
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 |
Revision as of 21:07, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Descriptional complexity of unambiguous input-driven pushdown automata |
scientific article |
Statements
Descriptional complexity of unambiguous input-driven pushdown automata (English)
0 references
6 January 2015
0 references
nondeterminism
0 references
unambiguity
0 references
input-driven pushdown automata
0 references
visibly pushdown automata
0 references
nested word automata
0 references
descriptional complexity
0 references