Back to Results
First PageMeta Content
Computer science / Finite-state machine / Nondeterministic finite automaton / Powerset construction / Nested word / Automata theory / Theoretical computer science / Models of computation


Efficient Solution of Language Equations Using Partitioned Representations Alan Mishchenko, Robert Brayton, Roland Jiang Tiziano Villa Nina Yevtushenko
Add to Reading List

Document Date: 2004-12-03 17:36:01

Open Document

File Size: 217,36 KB

Share Result on Facebook

Company

Fujitsu / MVSIS Group / Progressive / Intel / /

/

Facility

T. Villa / EECS Tomsk State University / Tiziano Villa / USA DIEGM University of Udine / EECS University of California / /

IndustryTerm

maximum solution / travel grant / direct product / optimum sub-solution / faster solution / multilevel deterministic sequential networks / multi-level sequential networks / main generic algorithm / deterministic product / multi-level network / computing / prefix-closed solution / multi-level networks / particular solution / non-deterministic product / sequential network / intermediate product / deterministic multi-level network / maximum prefix-closed solution / represented using multilevel deterministic sequential networks / /

OperatingSystem

Windows XP / XP / /

Organization

North Atlantic Treaty Organization / Roland Jiang Tiziano Villa Nina Yevtushenko Department / Italian National Research Council / National Science Foundation / Italy Department / UC Berkeley / EECS University / University of California / Berkeley / Tomsk State University / Russian Ministry of High Education / USA DIEGM University of Udine / /

Person

Robert K. Brayton / Alex Petrenko / Alberto Sangiovanni-Vincentelli / Robert Brayton / Roland Jiang Tiziano Villa Nina Yevtushenko / Alan Mishchenko / /

Position

author / /

ProgrammingLanguage

DC / /

Technology

BDD algorithms / main algorithm / end Algorithm / 3.1 Main Algorithm / partitioned algorithm / 7 3 Computation Algorithms / main generic algorithm / /

URL

http /

SocialTag