Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jason R. Smith 0002

> Home > Persons

Person information

affiliation: Louisiana Tech University, Ruston, LA, USA

Other persons with the same name

see FAQ

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2006
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CampeanuPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CampeanuPS06
Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2): 135-148 (2006)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2006
[c2]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/dcfs/CampeanuPS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/CampeanuPS06
Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231
2005
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/wia/CampeanuPS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/CampeanuPS05
Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103

Coauthor Index

see FAQ

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.