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.

Tobias Walter

dblp:78/908 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0001-8430-0235ORCID · reported

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

Software engineering, systems software and programming languages · 4 · 3 first-authorTheory of computation · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 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
3 papers
Automata and formal languages · 66% Coding theory · 18% Logic in computer science · 16%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
regular languages
0.632016
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay · ICALP 2016
Regular Languages Are Church-Rosser Congruential · J. ACM 2015
Regular Languages Are Church-Rosser Congruential · ICALP (2) 2012
Coding theory › source coding › variable-length codes
prefix codes
0.212016
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay · ICALP 2016
Logic in computer science
rewriting systems
0.212015
Regular Languages Are Church-Rosser Congruential · J. ACM 2015
Automata and formal languages
string rewriting
0.212015
Regular Languages Are Church-Rosser Congruential · J. ACM 2015

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

semi-thue systems · 0.2finite monoids · 0.2confluence · 0.2
YearPublicationVenuePosition
2018 Improving Range Prediction of Battery Electric Vehicles by Periodical Calculation of Driver Parameters based on Real Driving Data
Kurt Kruppok, Tobias Walter, Reiner Kriesten, Eric Sax
VEHITS2
2018 Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Manfred Kufleitner, Tobias Walter
Theory Comput. Syst.2
2017 Parikh-reducing Church-Rosser representations for some classes of regular languages
Tobias Walter
Theor. Comput. Sci.1
2016 Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
Volker Diekert, Tobias Walter
ICALP2
2015 Regular Languages Are Church-Rosser Congruential
abstract
This article shows a general result about finite monoids and weight reducing string rewriting systems. As a consequence it proves a long standing conjecture in formal language theory: All regular languages are Church-Rosser congruential. The class of Church-Rosser congruential languages was introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential if there exists a finite, confluent, and length-reducing semi-Thue system S such that L is a finite union of congruence classes modulo S . It was known that there are deterministic linear context-free languages which are not Church-Rosser congruential, but the conjecture was that all regular languages are of this form. The article offers a stronger statement: A language is regular if and only if it is strongly Church-Rosser congruential. It is the journal version of the conference abstract which was presented at ICALP 2012.
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
J. ACM4
2014 An ontology-based framework for domain-specific modeling
Tobias Walter, Fernando Silva Parreiras, Steffen Staab
Softw. Syst. Model.1
2012 Regular Languages Are Church-Rosser Congruential
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
ICALP (2)4
2011 Validation of Families of Business Processes
Gerd Gröner, Christian Wende, Marko Boskovic, Fernando Silva Parreiras, Tobias Walter, Florian Heidenreich, Dragan Gasevic, Steffen Staab
CAiSE5
2010 Joint Language and Domain Engineering
Tobias Walter, Fernando Silva Parreiras, Steffen Staab, Jürgen Ebert
ECMFA1
2010 A Model-Driven Approach for Using Templates in OWL Ontologies
Fernando Silva Parreiras, Gerd Gröner, Tobias Walter, Steffen Staab
EKAW3
2009 OntoDSL: An Ontology-Based Framework for Domain-Specific Languages
Tobias Walter, Fernando Silva Parreiras, Steffen Staab
MoDELS1