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â€¦Â (More)

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

2012

2012

- Arnaud Carayol, Cyril Nicaud
- STACS
- 2012

We study the distribution of the number of accessible states in deterministic and complete automata with n states over a kâ€¦Â (More)

Is this relevant?

2012

2012

- Roman R. Redziejowski
- Fundam. Inform.
- 2012

In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by anâ€¦Â (More)

Is this relevant?

2010

2010

- Markus Holzer, Andreas Maletti
- Theor. Comput. Sci.
- 2010

We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized niteâ€¦Â (More)

Is this relevant?

2009

2009

We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finiteâ€¦Â (More)

Is this relevant?

2005

2005

We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition ofâ€¦Â (More)

Is this relevant?

2000

2000

- Avraham Trakhtman
- Theor. Comput. Sci.
- 2000

A locally testable language L is a language with the property that for some nonnegative integer k, called the order or the levelâ€¦Â (More)

Is this relevant?

1999

1999

- John Abbott, Manuel Bronstein, Thom Mulders
- ISSAC
- 1999

III this paper wc consider &ernIiuistic cwrq~ulation of the esact dct.crIninant. of a tlcusc Inatris Af of iutcgcrs. 11-e presentâ€¦Â (More)

Is this relevant?

1997

1997

- Gonzalo Navarro
- 1997

One of the simplest approaches to approximate string matching is to consider the associated non-deterministic nite automaton andâ€¦Â (More)

Is this relevant?

1995

1995

- Dora Giammarresi, Rosa Montalbano
- STACS
- 1995

A generalized automaton (GA) is a nite automaton where the single transitions are deened on words rather than on single lettersâ€¦Â (More)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- Edsger W. Dijkstra
- Acta Informatica
- 1971

One of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic (onâ€¦Â (More)

Is this relevant?