A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Small Sweeping 2NFAs Are Not Closed Under Complement
[chapter]

2006
*
Lecture Notes in Computer Science
*

That is: does nondeterminism make

doi:10.1007/11786986_14
fatcat:lijkmx7n3jev7jpxjogf7umjpm
*a*difference*on*two-way finite*automata*that use only*a*"small" (i.e., polynomial) number of states? ... In this talk, we will sketch*a*proof of this claim for the special case of*automata*that are*sweeping*, in the sense that they can change the direction of their head only at the two ends of the tape. ... That is: does nondeterminism make*a*difference*on*two-way finite*automata*that use only*a*"small" (i.e., polynomial) number of states? ...##
###
Page 9261 of Mathematical Reviews Vol. , Issue 2002M
[page]

2002
*
Mathematical Reviews
*

Lisovik (UKR-KIEV-

*A*; Kiev) 2002m:68064 68Q45 Leung, Hing (1-NMS-C; Las Cruces, NM) Tight lower bounds*on*the size of*sweeping**automata*. (English summary) J. Comput. ... This result is tight in the sense that no family of NFAs over*a*unary alphabet can provide the same largest trade-off in sizes between NFAs and*sweeping**automata*. ...##
###
Lower bounds on the size of sweeping automata

1980
*
Journal of computer and system sciences (Print)
*

*A*more subtle encoding results in the same lower bound for

*sweeping*

*automata*and

*a*linear upper bound for lnfa. ... This depends upon the fact that if S is really

*a*

*sweeping*automaton and not

*a*ldfa then its must have at least

*one*state which moves left

*on*all input symbols and

*one*state which moves right

*on*all input ... CONCLUDING REMARKS

*A*natural direction to extend this work would be to consider nondeterministic

*sweeping*

*automata*(nsa). ...

##
###
Lower bounds on the size of sweeping automata

1979
*
Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79
*

*A*more subtle encoding results in the same lower bound for

*sweeping*

*automata*and

*a*linear upper bound for lnfa. ... This depends upon the fact that if S is really

*a*

*sweeping*automaton and not

*a*ldfa then its must have at least

*one*state which moves left

*on*all input symbols and

*one*state which moves right

*on*all input ... CONCLUDING REMARKS

*A*natural direction to extend this work would be to consider nondeterministic

*sweeping*

*automata*(nsa). ...

##
###
Tight Lower Bounds on the Size of Sweeping Automata

2001
*
Journal of computer and system sciences (Print)
*

*A*

*sweeping*automaton is

*a*two-way deterministic finite automaton which makes turns only at the endmarkers. ... We say that

*a*

*sweeping*automaton is degenerate if the automaton has no left-moving transitions. ... of nondegenerate

*sweeping*

*automata*. ...

##
###
A Heuristic for Constructing Smaller Automata Based on Suffix Sorting and Its Application in Network Security

2018
*
IEICE transactions on information and systems
*

In this paper we show

doi:10.1587/transinf.2017fcl0004
fatcat:ov5ahnuho5a6xnoh7rhgp3h6d4
*a*simple heuristic for constructing smaller*automata*for*a*set of regular expressions, based*on*suffix sorting: finding common prefixes and suffixes in regular expressions and merging ... The LCP value is 1, which tells they share*a*common prefix*a*.*Note*that we ignored # and following characters in suffixes. We keep*on*the line*sweeping*until the LCP value goes below θ 1 . ... Step 2: We group regular expressions by the common prefixes of length θ 1 using*a*simple line*sweeping**on*the suffix array. ...##
###
Size complexity of rotating and sweeping automata

2012
*
Journal of computer and system sciences (Print)
*

We examine the succinctness of

doi:10.1016/j.jcss.2011.06.004
fatcat:d2a5alvzebd2do2jb7qwtpvtpi
*one*-way, rotating,*sweeping*, and two-way deterministic finite*automata*(1dfas, rdfas, sdfas, 2dfas) and their nondeterministic and randomized counterparts. ... Here,*a*sdfa is*a*2dfa whose head can change direction only*on*the endmarkers and*a*rdfa is*a*sdfa whose head is reset to the left end of the input every time the right end-marker is read. ... Fig. 1 . 1 Computation of*a*(*a*)*sweeping*and (b) rotating automaton. Fig. 2 . 2 Fig. 2. Computation of*a**one*-way automaton. ...##
###
Page 511 of Mathematical Reviews Vol. , Issue 2004a
[page]

2004
*
Mathematical Reviews
*

This paper shows that,

*on*inputs of length exceeding 5n*, any n- state unary two-way nondeterministic finite automaton (2nfa) can be simulated by*a*(27 + 2)-state quasi-*sweeping*2nfa. ... into simpler*automata*. ...##
###
Infinite vs. finite size-bounded randomized computations

2014
*
Journal of computer and system sciences (Print)
*

We answer this question for rotating finite

doi:10.1016/j.jcss.2013.11.004
fatcat:my7v4ouorndmzpvv3cfix3jpji
*automata*(rfas) and*sweeping*finite*automata*(sfas). ... To prove our results, we introduce*a*technique for proving lower bounds*on*size of rfas (sfas) that generalizes the notion of generic strings discovered by M. ...*Note*that the definitions above are valid for any model of*one*-way randomized*automata*. ...##
###
Page 3744 of Mathematical Reviews Vol. , Issue 81I
[page]

1981
*
Mathematical Reviews
*

This is

*a*long expository paper*on*two-way*automata*and check. ing*automata*, and their mutual relationships. ... Jurgensen (Darmstadt) Inoue, Katsushi; Takanami, Itsuo 81i:68071*A**note**on*closure properties of the classes of sets accepted by tape-bounded two-dimensional Turing machines. Systems-Comput. ...##
###
Page 4456 of Mathematical Reviews Vol. , Issue 82j
[page]

1982
*
Mathematical Reviews
*

Sipser, Michael
Lower bounds

*on*the size of*sweeping**automata*. J. Comput. System Sci. 21 (1980), no. 2, 195-202. ...*Automata*, languages and programming ( Akko, 1981), pp. 495-505, Lecture*Notes*in Comput. Sci., 115, Springer, Berlin, 1981. ...##
###
Page 4901 of Mathematical Reviews Vol. , Issue 82k
[page]

1982
*
Mathematical Reviews
*

Wybraniec-Skardowska (Opole)
82k:68047
82k:68046
Berman, Piotr

*A**note**on**sweeping**automata*.*Automata*, languages and programming ( Proc. Seventh Internat. ... Sipser [Conference Record of the Eleventh Annual ACM Symposium*on*Theory of Computing (Atlanta, Ga., 1979), pp. 360-364, ACM, New York, 1979; MR 81i:68068] defined*sweeping**automata*, denoted by sa, as ...##
###
Execution Information Rate for Some Classes of Automata
[chapter]

2013
*
Lecture Notes in Computer Science
*

We study the Shannon information rate of accepting runs of various forms of

doi:10.1007/978-3-642-37064-9_21
fatcat:judhm7ggl5axlbuzlwwrtqxdyi
*automata*. The rate is therefore*a*complexity indicator for executions of the*automata*. ... We also conduct experiments*on*C programs showing that estimating information rates for their executions is feasible in many cases. ...*Note*that, due to the capabilities of CoFlo, we can only generate CFG of*a*function, rather than the entire program. ...##
###
Linear Grammars with One-Sided Contexts and Their Automaton Representation
[chapter]

2014
*
Lecture Notes in Computer Science
*

These grammars are proved to be computationally equivalent to an extension of

doi:10.1007/978-3-642-54423-1_17
fatcat:e63ob2llvrdh5dx5uf7yhenpyu
*one*-way real-time cellular*automata*with an extra data channel. ... The main result is the undecidability of the emptiness problem for grammars restricted to*a**one*-symbol alphabet, which is proved by simulating*a*Turing machine by*a*cellular automaton with feedback. ...*one**sweep*for each step of T . ...##
###
A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton

2018
*
International Colloquium on Automata, Languages and Programming
*

This lower bound only involves

doi:10.4230/lipics.icalp.2018.138
dblp:conf/icalp/Raskin18
fatcat:meyreoogdzgqjikz42vtufwdzq
*a**one*letter alphabet, and makes use of the random graph methods. ... The same proof also shows that the translation of*sweeping**automata*to non-deterministic*automata*is superpolynomial. ... We also*note*that the same languages (and their complements) can be recognized by*sweeping*deterministic finite*automata*with*a*small increase in the state complexity compared to the case of UFA. ...
« Previous

*Showing results 1 — 15 out of 2,709 results*