Maria Huber

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

dblp:27/7032 · DBLP profile ↗

← Back

4ranked-venue papers

0as first author

0since 2021 · last 2005

—ORCID · none

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

Theory of computation · 4

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

1 paper

Automata and formal languages · 100%

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

Topic	Papers	Last	Evidence papers
Automata and formal languages › formal language operations closure properties	1	2002	Test Sets for the Universal and Existential Closure of Regular Tree Languages · Inf. Comput. 2002
Automata and formal languages › tree languages regular tree language	1	2002	Test Sets for the Universal and Existential Closure of Regular Tree Languages · Inf. Comput. 2002
Automata and formal languages › finite automata test sets	1	2002	Test Sets for the Universal and Existential Closure of Regular Tree Languages · Inf. Comput. 2002

Year	Publication	Venue	Position
2005	On state-alternating context-free grammars Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto	Theor. Comput. Sci.	3
2002	Test Sets for the Universal and Existential Closure of Regular Tree Languages Dieter Hofbauer, Maria Huber	Inf. Comput.	2
1999	Test Sets for the Universal and Existential Closure of Regular Tree Languages Dieter Hofbauer, Maria Huber	RTA	2
1994	Linearizing Term Rewriting Systems Using Test Sets Dieter Hofbauer, Maria Huber	J. Symb. Comput.	2