Jacques Sakarovitch

From MaRDI portal
Revision as of 03:04, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Jacques Sakarovitch to Jacques Sakarovitch: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:505063

Available identifiers

zbMath Open sakarovitch.jacquesMaRDI QIDQ505063

List of research outcomes





PublicationDate of PublicationType
The net automaton of a rational expression2023-07-26Paper
Morphisms and Minimisation of Weighted Automata2022-10-07Paper
Rational and Recognisable Power Series2022-04-28Paper
Automata and rational expressions2022-02-04Paper
The carry propagation of the successor function2020-09-01Paper
On subtrees of the representation tree in rational base numeration systems2018-12-10Paper
The validity of weighted automata2018-11-07Paper
Two routes to automata minimization and the ways to reach it efficiently2018-11-07Paper
Trees and languages with periodic signature2017-01-18Paper
The signature of rational languages2016-12-19Paper
https://portal.mardi4nfdi.de/entity/Q28193792016-09-29Paper
Trees and Languages with Periodic Signature2016-05-03Paper
Breadth-First Serialisation of Trees and Rational Languages2014-10-14Paper
A Type System for Weighted Automata and Rational Expressions2014-09-26Paper
Auto-similarity in Rational Base Number Systems2013-09-20Paper
On Sets of Numbers Rationally Represented in a Rational Base Number System2013-09-20Paper
Implementation Concepts in Vaucanson 22013-08-07Paper
THE VALIDITY OF WEIGHTED AUTOMATA2013-07-30Paper
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure2013-06-28Paper
https://portal.mardi4nfdi.de/entity/Q49107552013-03-19Paper
The Removal of Weighted ε-Transitions2012-09-20Paper
Number representation and finite automata2011-04-18Paper
https://portal.mardi4nfdi.de/entity/Q30869302011-03-30Paper
Corrigendum to our paper: How Expressions Can Code for Automata2010-12-01Paper
Lexicographic decomposition of \(k\)-valued transducers2010-10-06Paper
Radix Cross-Sections for Length Morphisms2010-04-27Paper
Weighted automata with discounting2010-04-19Paper
Radix enumeration of rational languages2010-03-12Paper
https://portal.mardi4nfdi.de/entity/Q36512092009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q36443882009-11-04Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Powers of rationals modulo 1 and rational base number systems2009-02-17Paper
On the Decidability of Bounded Valuedness for Transducers2009-02-03Paper
Conjugacy and Equivalence of Weighted Automata and Functional Transducers2007-05-02Paper
Implementation and Application of Automata2006-11-13Paper
Implementation and Application of Automata2006-11-13Paper
Sequential?2006-05-18Paper
Automata, Languages and Programming2006-01-10Paper
How expressions can code for automata2005-06-07Paper
Derivatives of rational expressions with multiplicity2005-04-06Paper
Introducing VAUCANSON2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q30443172004-08-11Paper
TWO GROUPS ASSOCIATED WITH QUADRATIC PISOT UNITS2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47085962003-06-18Paper
The finite power property in free groups2003-05-14Paper
Squaring transducers: An efficient procedure for deciding functionality and sequentiality.2003-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45084642001-07-15Paper
AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q45083952000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q49386142000-04-25Paper
On the representation of finite deterministic 2-tape automata2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43952141999-03-09Paper
A construction on finite automata that has remained hidden1999-01-12Paper
Deterministic synchronization of automata with bounded delay1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43479601997-08-12Paper
Synchronized rational relations of finite and infinite words1993-10-17Paper
https://portal.mardi4nfdi.de/entity/Q40356571993-05-18Paper
Easy multiplications. II: Extensions of rational semigroups1990-01-01Paper
Finiteness Conditions on Subgroups and Formal Language Theory1989-01-01Paper
On regular trace languages1987-01-01Paper
Easy multiplications. I: The realm of Kleene's theorem1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774901987-01-01Paper
On the complexity of some extended word problems defined by cancellation rules1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257741986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282641986-01-01Paper
An application of the matrix representation of transductions1985-01-01Paper
A Problem on Rational Subsets of the Free Group1984-01-01Paper
Recurrent words for substitution1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574571983-01-01Paper
On the Hotz group of a context-free grammar1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33322511982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39601381982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36893691981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39214161981-01-01Paper
Sur une propriété d'itération des langages algébriques déterministes1981-01-01Paper
Monoides pointes1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41916251979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30513981977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381761977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41785091977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41365951976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41442091976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41110971975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41819771975-01-01Paper

Research outcomes over time

This page was built for person: Jacques Sakarovitch