# Automata, Languages and Programming

@inproceedings{Nielsen2002AutomataLA, title={Automata, Languages and Programming}, author={M. Nielsen}, booktitle={Lecture Notes in Computer Science}, year={2002} }

Invited Talks.- Generating Hard Instances of the Short Basis Problem.- Wide Area Computation.- Proof Techniques for Cryptographic Protocols.- Type Structure for Low-Level Programming Languages.- Real Computations with Fake Numbers.- A Model for Associative Memory, a Basis for Thinking and Consciousness.- Numerical Integration with Exact Real Arithmetic.- Observations about the Nature and State of Computer Science.- DNA Computing: New Ideas and Paradigms.- Online Data Structures in External… Expand

#### 2 Citations

Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures

- Mathematics, Computer Science
- Induction, Algorithmic Learning Theory, and Philosophy
- 2007

An inductive inference learner for a computably enumerable set A is a system or a device, usually algorithmic, which when successively fed data for A outputs a sequence of Godel codes that at a certain point stabilize at codes correct for A. Expand

Aspects of Metric Spaces in Computation

- Mathematics, Computer Science
- 2008

Three major kinds of questions about metric spaces are considered here: the intrinsic dimensionality of a distribution, the maximum number of distance permutations, and the difficulty of reverse similarity search. Expand

#### References

SHOWING 1-7 OF 7 REFERENCES

Asynchronous consensus and broadcast protocols

- Computer Science
- JACM
- 1985

The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability 1 for these systems are investigated, and it is shown that correct processes are necessary and sufficient to achieve Byzantine Agreement. Expand

Towards mobile cryptography

- Computer Science
- Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
- 1998

This paper conceptualizes the specific cryptographic problems posed by mobile code, and it is able to provide a solution for some of these problems, and presents techniques to achieve "non-interactive evaluation with encrypted functions" in certain cases. Expand

Impossibility of distributed consensus with one faulty process

- Computer Science
- PODS '83
- 1983

It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem. Expand

A language with distributed scope

- Computer Science
- POPL '95
- 1995

Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation and distributed lexical scoping is the key mechanism for managing distributed computation. Expand

Linda in context

- Computer Science
- CACM
- 1989

How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.

A calculus of mobile processes , Parts 1 - 2