◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Jančar

21 papers hereh-index 262.1k citations110 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author8
  • first author7
  • middle author3
  • last author3

Across the 21 of 21 papers where every author was matched, so the position is known.

fields
  • cs.LO16
  • cs.FL4
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20102021
most citedBisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

31 citations · 56 across the 19 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

cs.FL2010★ 3 cited

A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars

Petr Jancar

The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solve…

cs.GT2010

Reachability Games on Extended Vector Addition Systems with States

Tomas Brazdil, Petr Jancar, Antonin Kucera

We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.