◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Trahtman

9 papers hereh-index 12359 citations39 works total

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

author position
  • sole author9

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

fields
  • cs.FL7
  • cs.DM2

identity via Semantic Scholar / OpenAlex

activity
20072022
most citedAn algorithm to verify local threshold testability of deterministic finite automata

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

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.FL2021

Verification Tools for Checking some kinds of Testability

A. N. Trahtman

A locally testable language L is a language with the property that for some non negative integer k, called the order of local testability, whether or not a word u is in the languag…

cs.FL2021★ 8 cited

An algorithm to verify local threshold testability of deterministic finite automata

A. N. Trahtman

A locally threshold testable language L is a language with the property that for some non negative integers k and l, whether or not a word u is in the language L depends on (1) the…

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