Sciweavers

1728 search results - page 130 / 346
» The Size of Power Automata
Sort
View
DFT
2004
IEEE
118views VLSI» more  DFT 2004»
15 years 10 months ago
Defect Characterization for Scaling of QCA Devices
Quantum dot Cellular Automata (QCA) is amongst promising new computing scheme in the nano-scale regimes. As an emerging technology, QCA relies on radically different operations in...
Jing Huang, Mariam Momenzadeh, Mehdi Baradaran Tah...
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 6 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
IEICET
2006
114views more  IEICET 2006»
15 years 6 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
JUCS
2010
130views more  JUCS 2010»
15 years 5 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
ICGI
2010
Springer
15 years 4 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer