Olivier Carton

IEEE Trans. Inf. Theory, October, 2024

Deterministic pushdown automata can compress some normal sequences.

[BibT_eX]

[DOI]

Sylvain Perifel

Log. Methods Comput. Sci., 2024

Rauzy dimension and finite-state dimension.

[BibT_eX]

[DOI]

Santiago Figueira

CoRR, 2024

Addition in Dumont-Thomas Numeration Systems in Theory and Practice.

[BibT_eX]

[DOI]

CoRR, 2024

Mahler equations for Zeckendorf numeration.

[BibT_eX]

[DOI]

Reem Yassawi

CoRR, 2024

2023

Nested perfect toroidal arrays.

[BibT_eX]

[DOI]

CoRR, 2023

Deterministic Regular Functions of Infinite Words.

[BibT_eX]

[DOI]

Gaëtan Douéneau-Tabot

Emmanuel Filiot

Sarah Winter

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Preservation of normality by transducers.

[BibT_eX]

[DOI]

Elisa Orduna

Inf. Comput., 2022

Continuous Rational Functions Are Deterministic Regular.

[BibT_eX]

[DOI]

Gaëtan Douéneau-Tabot

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Ambiguity Through the Lens of Measure Theory.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Preservation of Normality by Unambiguous Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Preservation of Normality by Non-Oblivious Group Selection.

[BibT_eX]

[DOI]

Joseph Vandehey

Theory Comput. Syst., 2021

Minimisation of automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

On Normality in Shifts of Finite Type.

[BibT_eX]

[DOI]

Nicolás Alvarez

Theory Comput. Syst., 2020

Transfinite Lyndon words.

[BibT_eX]

[DOI]

Luc Boasson

Log. Methods Comput. Sci., 2020

Continuity of Functional Transducers: A Profinite Study of Rational Functions.

[BibT_eX]

[DOI]

Michaël Cadilhac

Charles Paperman

Log. Methods Comput. Sci., 2020

A direct proof of Agafonov's theorem and an extension to shift of finite type.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Polishness of some topologies related to word or tree automata.

[BibT_eX]

[DOI]

Dominique Lecomte

Log. Methods Comput. Sci., 2019

Finite-state independence and normal sequences.

[BibT_eX]

[DOI]

Nicolás Alvarez

J. Comput. Syst. Sci., 2019

Normal numbers and nested perfect necklaces.

[BibT_eX]

[DOI]

J. Complex., 2019

Low discrepancy sequences failing Poissonian pair correlations.

[BibT_eX]

[DOI]

Ignacio Mollo Cunningham

CoRR, 2019

2018

Finite-State Independence.

[BibT_eX]

[DOI]

Pablo Ariel Heiber

Theory Comput. Syst., 2018

A survey on difference hierarchies of regular languages.

[BibT_eX]

[DOI]

Jean-Éric Pin

Log. Methods Comput. Sci., 2018

An Algebraic Approach to MSO-Definability on Countable linear Orderings.

[BibT_eX]

[DOI]

Thomas Colcombet

Gabriele Puppis

J. Symb. Log., 2018

Normal numbers with digit dependencies.

[BibT_eX]

[DOI]

Christoph Aistleitner

CoRR, 2018

Simon's Theorem for Scattered Words.

[BibT_eX]

[DOI]

Maurice Pouzet

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Counter Machines and Distributed Automata - A Story About Exchanging Space and Time.

[BibT_eX]

[DOI]

Bruno Guillon

Fabian Reiter

Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017

Polishness of some topologies related to automata (Extended version).

[BibT_eX]

[DOI]

Dominique Lecomte

CoRR, 2017

Continuity and Rational Functions.

[BibT_eX]

[DOI]

Michaël Cadilhac

Charles Paperman

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Two-Way Two-Tape Automata.

[BibT_eX]

[DOI]

Léo Exibard

Olivier Serre

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Polishness of Some Topologies Related to Automata.

[BibT_eX]

[DOI]

Dominique Lecomte

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2015

Normality and automata.

[BibT_eX]

[DOI]

Pablo Ariel Heiber

J. Comput. Syst. Sci., 2015

Normality and two-way automata.

[BibT_eX]

[DOI]

Pablo Ariel Heiber

Inf. Comput., 2015

Rational Selecting Relations and Selectors.

[BibT_eX]

[DOI]

Luc Boasson

Proceedings of the Language and Automata Theory and Applications, 2015

Aperiodic Two-way Transducers and FO-Transductions.

[BibT_eX]

[DOI]

Luc Dartois

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Asymptotic Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Achim Blumensath

Thomas Colcombet

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Channel Synthesis Revisited.

[BibT_eX]

[DOI]

Béatrice Bérard

Proceedings of the Language and Automata Theory and Applications, 2014

2012

An aperiodicity problem for multiwords.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

Two-Way Transducers with a Two-Way Output Tape.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Wavelength-Selective Shape Memory Alloy for Wireless Microactuation of a Bistable Curved Beam.

[BibT_eX]

[DOI]

IEEE Trans. Ind. Electron., 2011

Regular Languages of Words over Countable Linear Orderings.

[BibT_eX]

[DOI]

Thomas Colcombet

Gabriele Puppis

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Algebraic Characterization of FO for Scattered Linear Orderings.

[BibT_eX]

[DOI]

Alexis Bès

Proceedings of the Computer Science Logic, 2011

2010

Sturmian Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Logic and Rational Languages of Words Indexed by Linear Orderings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

The expressive power of the shuffle product.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Minimization of Automata

[BibT_eX]

[DOI]

CoRR, 2010

Right-Sequential Functions on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2010

2009

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.

[BibT_eX]

[DOI]

Jean Berstel

Luc Boasson

Theor. Comput. Sci., 2009

Languages Recognized by Finite Supersoluble Groups.

[BibT_eX]

[DOI]

Jean-Éric Pin

Xaro Soler-Escrivà

J. Autom. Lang. Comb., 2009

Tree Automata and Automata on Linear Orderings.

[BibT_eX]

[DOI]

Véronique Bruyère

Géraud Sénizergues

RAIRO Theor. Informatics Appl., 2009

Infinite words without palindrome

[BibT_eX]

[DOI]

CoRR, 2009

Left and Right Synchronous Relations.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

On the continuity set of an Omega rational function.

[BibT_eX]

[DOI]

Pierre Simonnet

RAIRO Theor. Informatics Appl., 2008

Automata and semigroups recognizing infinite words.

[BibT_eX]

Jean-Eric Pin

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Complementation of rational sets on scattered linear orderings of finite rank.

[BibT_eX]

[DOI]

Chloe Rispal

Theor. Comput. Sci., 2007

The growth ratio of synchronous rational relations is unique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Automata on linear orderings.

[BibT_eX]

[DOI]

Véronique Bruyère

J. Comput. Syst. Sci., 2007

A First Investigation of Sturmian Trees.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

2006

Operations preserving regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Decision problems among the main subfamilies of rational relations.

[BibT_eX]

[DOI]

Christian Choffrut

Serge Grigorieff

RAIRO Theor. Informatics Appl., 2006

A Kleene Theorem for Languages of Words Indexed by Linear Orderings.

[BibT_eX]

[DOI]

Alexis Bès

Int. J. Found. Comput. Sci., 2006

2005

Hierarchy Among Automata on Linear Orderings.

[BibT_eX]

[DOI]

Véronique Bruyère

Theory Comput. Syst., 2005

Complementation of rational sets on countable scattered linear orderings.

[BibT_eX]

[DOI]

Chloe Rispal

Int. J. Found. Comput. Sci., 2005

2004

Determinization of Transducers over Infinite Words: The General Case.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

On the Complexity of Hopcroft's State Minimization Algorithm.

[BibT_eX]

[DOI]

Jean Berstel

Proceedings of the Implementation and Application of Automata, 2004

2003

Unambiguous Büchi automata.

[BibT_eX]

[DOI]

Max Michel

Theor. Comput. Sci., 2003

Squaring transducers: an efficient procedure for deciding functionality and sequentiality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Unambiguous Automata on Bi-infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Operations Preserving Recognizable Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Determinization of transducers over finite and infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Monadic Theory of Morphic Infinite Words and Generalizations.

[BibT_eX]

[DOI]

Wolfgang Thomas

Inf. Comput., 2002

Accessibility in Automata on Scattered Linear Orderings.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Periodicity and roots of transfinite strings.

[BibT_eX]

[DOI]

Christian Choffrut

RAIRO Theor. Informatics Appl., 2001

2000

Computing the prefix of an automaton.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Asynchronous sliding block maps.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Determinization of Transducers over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

R-Trivial Languages of Words on Countable Ordinals.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

1999

Computing the Rabin Index of a Parity Automaton.

[BibT_eX]

[DOI]

Ramón Maceiras

RAIRO Theor. Informatics Appl., 1999

The Wagner Hierarchy.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

1998

An Eilenberg Theorem for Words on Countable Ordinals.

[BibT_eX]

[DOI]

Nicolas Bedon

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

A Hierarchy of Cyclic Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1997

Chains and Superchains for ω-Rational Sets, Automata and Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1997

The Wadge-Wagner Hierarchy of omega-Rational Sets.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Chain Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Cyclic Languages and Strongly Cyclic Languages.

[BibT_eX]

[DOI]