Deterministic Frequency Pushdown Automata

ResearchSpace/Manakin Repository

Show simple item record Calude, CS en Freivalds, R en Stephan, F en 2014-01-05T22:48:16Z en 2014-01-05T22:48:16Z en 2013 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-441 (2013) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract Frequency computation was introduced by Rose [26]. Trakhtenbrot [27] proved the existence of a continuum of functions computable by frequency Turing machines with frequency 1/2 . In contrast, every function computable by a frequency Turing machine with frequency exceeding 1/2 is recursive. Essentially similar results for finite automata and other types of machines have been proved by Kinber [19] and Austinat, Diekert, Hertrampf, Petersen [4]. In this paper we introduce the notion of frequency pushdown automaton. Answering a question E. Shamir posed at LATA 2013, we prove that there is a language which is 1/1 -recognizable but which is not 2/n - recognizable (for any n) by deterministic frequency pushdown automaton. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.source.uri en
dc.title Deterministic Frequency Pushdown Automata en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Full text options

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace

Advanced Search