Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Julien Brusten

dblp:72/1917 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automata and formal languages · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › infinite words
automatic sequences		 0.222008
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases · ICALP (2) 2008
A Generalization of Cobham's Theorem to Automata over Real Numbers · ICALP 2007
Automata and formal languages › number systems
base dependence		 0.222008
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases · ICALP (2) 2008
A Generalization of Cobham's Theorem to Automata over Real Numbers · ICALP 2007
Automata and formal languages › infinite words
cobham's theorem		 0.112007
A Generalization of Cobham's Theorem to Automata over Real Numbers · ICALP 2007

Methods — techniques the papers use, named apart from their topics

finite automata · 0.1generalization of cobham's theorem · 0.1
YearPublicationVenuePosition
2012 Automata-Based Symbolic Representations of Polyhedra
Bernard Boigelot, Julien Brusten, Jean-François Degbomont
 LATA2
2009 A Generalization of Semenov's Theorem to Automata over Real Numbers
Bernard Boigelot, Julien Brusten, Jérôme Leroux
 CADE2
2009 A generalization of Cobham's theorem to automata over real numbers
Bernard Boigelot, Julien Brusten
 Theor. Comput. Sci.2
2008 On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Bernard Boigelot, Julien Brusten, Véronique Bruyère
 ICALP (2)2
2007 A Generalization of Cobham's Theorem to Automata over Real Numbers
Bernard Boigelot, Julien Brusten
 ICALP2