A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Unary Languages Recognized by Two-Way One-Counter Automata
[chapter]
2014
Lecture Notes in Computer Science
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages. Up to our knowledge, the only known unary nonregular languages recognized by 2D1CAs are those formed by strings having exponential length, where the exponents form some trivial unary regular language. In this paper, we present some nontrivial subsets of these
doi:10.1007/978-3-319-08846-4_11
fatcat:xk7qy27eorf7jlsh5tlu5nba3m