Paper Info
Title
Insertion Operations on Deterministic Reversal-Bounded Counter Machines.
Abstract
Abstract Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, suffix, and outfix relations, as well as operations defined from inverses of a type of deterministic transducer with reversal-bounded counters attached. The question of whether the resulting languages can always be accepted by deterministic machines with the same number (or larger number) of input-turns (resp., counters, counter-reversals, etc.) is investigated.
Year
DOI
Venue
2015
10.1007/978-3-319-15579-1_15
Journal of Computer and System Sciences
Field
DocType
Volume
Discrete mathematics,Suffix,Computer science,Determinism,Finite-state machine,Prefix,Infix,Regular language,Bounded function
Conference
104
Citations 
PageRank 
References 
3
0.44
11
Authors
3
Name
Order
Citations
PageRank
Joey Eremondi181.65
Oscar H. Ibarra211612.17
Ian McQuillan39724.72