Irène Durand

Available identifiers

Publication	Date of Publication	Type
On defining linear orders by automata	2020-11-10	Paper
Decidable call by need computations in term rewriting (extended abstract)	2019-10-01	Paper
Computations by fly-automata beyond monadic second-order logic	2016-02-26	Paper
Bottom-up rewriting for words and terms	2014-09-11	Paper
\texttt{Autowrite}: a tool for term rewrite systems and tree automata	2013-09-20	Paper
Model-Checking by Infinite Fly-Automata	2013-09-20	Paper
Automata for the verification of monadic second-order graph properties	2013-05-02	Paper
https://portal.mardi4nfdi.de/entity/Q5389154	2012-04-25	Paper
Left-linear Bounded TRSs are Inverse Recognizability Preserving	2012-04-24	Paper
Fly-Automata, Their Properties and Applications	2011-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q3395335	2009-08-26	Paper
Bottom-Up Rewriting Is Inverse Recognizability Preserving	2008-01-02	Paper
Decidable call-by-need computations in term rewriting	2005-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4808760	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q2769431	2002-02-05	Paper
Bounded, strongly sequential and forward-branching term rewriting systems	1995-06-08	Paper
Constructor equivalent term rewriting systems are strongly sequential: A direct proof	1994-11-20	Paper
Constructor equivalent term rewriting systems	1993-11-15	Paper

This page was built for person: Irène Durand