Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal

DOI10.1016/J.IPL.2010.03.008zbMATH Open1229.68047OpenAlexW1970263278MaRDI QIDQ656586FDOQ656586

Marcin Balcerzak, Damian Niwiński

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.008

zbMATH Keywords

formal languagesregular languagesbounded number of reversalstwo-way finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds on the size of sweeping automata
• Nondeterminism and the size of two way finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fooling a two-way nondeterministic multihead automaton with reversal number restriction

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656586)