#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1979

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Denis Thérien, Thomas Wilke
- STOC
- 1998

We show a property of strings is expressible in the two-variable fragment of first-order logic if and only if it is expressible by both a 2 and a 2 sentence. We thereby establish: UTL = FO2 = 2 \ 2 = UL ; where UTL stands for the string properties expressible in the temporal logic with ‘eventually in the future’ and ‘eventually in the past’ as the only… (More)

Erklärung Hiermit versichere ich, dass ich die vorliegende Masterarbeit selbstständig verfasst und keine anderen Quellen und Hilfsmittel als die angegebenen benutzt habe.

- David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
- J. Comput. Syst. Sci.
- 1992

- Howard Straubing, Denis Thérien, Wolfgang Thomas
- ICALP
- 1988

- Thomas Schwentick, Denis Thérien, Heribert Vollmer
- Developments in Language Theory
- 2001

- David A. Mix Barrington, Denis Thérien
- J. ACM
- 1988

Recently a new connection was discovered between the parallel complexity class <italic>NC</italic><supscrpt>1</supscrpt> and the theory of finite automata in the work of Barrington on bounded width branching programs. There (nonuniform) <italic>NC</italic><supscrpt>1</supscrpt> was characterized as those languages recognized by a certain nonuniform version… (More)

- Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien
- Theory of Computing Systems
- 2004

We use tools from the algebraic theory of automata to investigate the class of languages recognized by two models of Quantum Finite Automata (QFA): Brodsky and Pippenger's end-decisive model (which we call BPQFA) and a new QFA model (which we call LQFA) whose definition is motivated by implementations of quantum computers using nucleo-magnetic resonance… (More)

- David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
- J. Comput. Syst. Sci.
- 2005

A language L over an alphabet A is said to have a neutral letter if there is a letter e ∈ A such that inserting or deleting e’s from any word in A∗ does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in firstorder logic. It was conjectured that it renders all numerical predicates… (More)

- David A. Mix Barrington, Denis Thérien
- ICALP
- 1987

A new model, non-uniform deterministic finite automata (NUDFA’s) over general tinite monoids, has recently been developed as a strong link between the theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform NC’, NUDFA… (More)

- Pascal Tesson, Denis Thérien
- Logical Methods in Computer Science
- 2007

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical formalism required to define them. The algebraic point of view on automata is an essential complement of this… (More)