Paper Info
Title
Deletion Operations on Deterministic Families of Automata.
Abstract
It is shown that one-way deterministic reversal-bounded multicounter languages are closed under right quotient with languages from many language families; even those defined by nondeterministic machines such as the context-free languages. Also, it is shown that when starting with one-way deterministic machines with one counter that makes only one reversal, taking the left quotient with languages from many different language families — again including those defined by nondeterministic machines such as the context-free languages — yields only one-way deterministic reversal-bounded multicounter languages. These results are surprising given the nondeterministic nature of the deletion. However, if there are two more reversals on the counter, or a second 1-reversal-bounded counter, taking the left quotient (or even just the suffix operation) yields languages that can neither be accepted by deterministic reversal-bounded multi-counter machines, nor by 2-way deterministic machines with one reversal-bounded counter.
Year
DOI
Venue
2015
10.1016/j.ic.2017.07.009
Information and Computation
Keywords
Field
DocType
Automata and logic,Counter machines,Deletion operations,Reversal-bounds,Determinism,Finite automata
Deterministic context-free grammar,Discrete mathematics,Deterministic automaton,Nested word,Nondeterministic algorithm,Computer science,Deterministic finite automaton,Abstract family of languages,Deterministic pushdown automaton,Deterministic context-free language,Theoretical computer science
Conference
Volume
ISSN
Citations 
256
0890-5401
4
PageRank 
References 
Authors
0.48
14
3
Name
Order
Citations
PageRank
Joey Eremondi181.65
Oscar H. Ibarra23235741.44
Ian McQuillan39724.72