Publication | Closed Access

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds

Pushdown AutomataSyntaxEngineeringAutomated ReasoningGrammatical FormalismComputational LinguisticsFormal MethodsPushdown AutomatonAutomaton OperationGrammarDescriptional ComplexityLanguage StudiesUnification GrammarLinguisticsUnary Context-free Grammars