Back to Results
First PageMeta Content
Theoretical computer science / Formal languages / Computer science / Pushdown automaton / Deterministic pushdown automaton / Nondeterministic finite automaton / Deterministic finite automaton / Stack / Chomsky hierarchy / Automata theory / Theory of computation / Models of computation


Efficient Solutions for the Complement of wwR and the Complement of ww Allaoua Refoufi Computer Science Department University of Sétif Algéria
Add to Reading List

Document Date: 2015-01-12 10:33:13

Open Document

File Size: 88,39 KB

Share Result on Facebook

City

Rockville / Reading / Boulder / /

Company

Computer Science Press / Other Rewriting Systems / /

Country

United States / Algeria / United Kingdom / /

Currency

USD / /

/

Facility

University of Sheffield / University of Setif / Allaoua Refoufi Computer Science Department University / University of Colorado / /

IndustryTerm

naïve solution / deterministic solutions / natural language processing / non deterministic solutions / semantic web technologies / /

Movie

Professor / /

Organization

University of Sheffield / University of Setif / University of Colorado / Allaoua Refoufi Computer Science Department University of Sétif Algéria / /

/

Position

Biography The author / author / Professor / same forward / input head / General / wB / /

ProvinceOrState

Maryland / Colorado / /

PublishedMedium

Theoretical Computer Science / /

Technology

main algorithm / natural language processing / artificial intelligence / semantic web technologies / 2.1 Algorithm / /

SocialTag