Report icon

Report

Safety is not a restriction at level 2 for string languages

Abstract:

Recent work by Knapik, Niwinski and Urzczyn [KNU02] has revived interest in the connexions between higher-order grammars and higher-order pushdown automata. Both devices can be viewed as definitions for term trees as well as string languages. In the latter setting we recall the extensive study by Damm [Dam82], and Damm and Goerdt [DG86]. There it was shown that the language of a level-n higher-order grammar is accepted by a level-n higher-order pushdown automaton subject to ...

Expand abstract

Actions


Authors


J.G. de Miranda More by this author
C.−H.L. Ong More by this author
Publisher:
Oxford University Computing Laboratory
Publication date:
2004-10-01
URN:
uuid:e67075b8-7cf3-4f2e-8939-3619378e6c4e
Local pid:
cs:40

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP