Deterministic sequential functions

Harju, Tero; Kleijn, H. C. M.; Latteux, Michel

doi:10.1007/bf01185560

Search citation statements

Order By: Relevance

Paper Sections

Select...

String Editing and Block Moves1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1994

1997

Publication Types

Select...

Book3

Other1

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many commands in the Unix (R) stream editor sed are representable this way. The particular model of finite-state machine we use is the deterministic generalized sequential machine (DGSM), as formalized in [HU79] or [HKL92]. The Player P has some finite set S of DGSMs available to her.…”

Section: String Editing and Block Movesmentioning

confidence: 99%

On superlinear lower bounds in complexity theory

Regan

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference

View full text Add to dashboard Cite

This paper first surveys the near-total lack of superlinear lower bounds in complexity theory, for "natural" computational problems with respect to many models of computation. We note that the dividing line between models where such bounds are known and those where none are known comes when the model allows non-local communication with memory at unit cost. We study a model that imposes a "fair cost" for non-local communication, and obtain modest superlinear lower bounds for some problems via a Kolmogorov-complexity argument. Then we look to the larger picture of what it will take to prove really striking lower bounds, and pull from ours and others' work a concept of information vicinity that may offer new tools and modes of analysis to a young field that rather lacks them.

show abstract

Section: String Editing and Block Movesmentioning

confidence: 99%