Deterministic automaton

Known as: Deterministic computation

In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

With increasing complexity of automation processes, distributed automation systems are required to meet real-time constraints of…

2014

2012

In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In…

2010

A magnetoinductive flow measuring method for measuring the flow rate of a medium flowing through a measuring tube is described…

2004

Non-deterministic computation is not really computation, but the difference with real computation is blurred. We study in detail…

1995

Algorithms and techniques to determinize and complement Ω-automata with various forms of fairness constraints are investigated…

1994

Intelligent on-line monitoring of ICU patients requires mechanisms to detect and interpret significant patterns in theflood of…

1993

Lazy evaluation and sharing are two of the most important issues in implementations of lazy functional languages. However they…

1989

In this paper, we give an oracle under which BPP is equal to probabilistic linear time, an unusual collapse of a complexity time…

1975