↓ Skip to main content

Reachability Problems

Overview of attention for book
Attention for Chapter 6: Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
Altmetric Badge

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
Chapter number 6
Book title
Reachability Problems
Published by
Springer, Cham, January 2022
DOI 10.1007/978-3-031-19135-0_6
Book ISBNs
978-3-03-119134-3, 978-3-03-119135-0
Authors

Yamakami, Tomoyuki

Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%