umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On input-revolving deterministic and nondeterministic finite automata
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Institut für Informatik, Universität Potsdam.
Institut für Informatik, Universität Giessen.
Institut für Informatik, Universität Giessen.
2009 (English)In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 207, 1140-1155 p.Article in journal (Refereed) Published
Abstract [en]

We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to the left, revolving to the right, and circular-interchanging. We investigate the computational capacities of these three types of automata and their deterministic variants, comparing any of the six classes of automata with each other and with further classes of well-known automata. In particular, it is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any determinstic automaton of the same type. Concerning the closure properties most of the deterministic language families studied are not closed under standard operations. For example, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.

Place, publisher, year, edition, pages
2009. Vol. 207, 1140-1155 p.
Keyword [en]
Extended finite automata, Formal language operations, Computational power, Closure properties, Anti-abstract family of languages
National Category
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-31785OAI: oai:DiVA.org:umu-31785DiVA: diva2:294226
Available from: 2010-02-16 Created: 2010-02-16 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Bensch, Suna
By organisation
Department of Computing Science
In the same journal
Information and Computation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf