◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Maris Valdats

3 papers hereh-index 259 citations5 works total

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

author position
  • sole author2
  • last author1

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

fields
  • quant-ph2
  • cs.FL1

identity via Semantic Scholar / OpenAlex

most citedOn the class of languages recognizable by 1-way quantum finite automata

4 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2014★ 1 cited

Boolean Circuit Complexity of Regular Languages

Maris Valdats

In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DF…

◍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.