Sciweavers

426 search results - page 40 / 86
» Synchronization of Regular Automata
Sort
View
JALC
2007
79views more  JALC 2007»
13 years 7 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
ARITH
2007
IEEE
14 years 2 months ago
Serial Parallel Multiplier Design in Quantum-dot Cellular Automata
An emerging nanotechnology, quantum-dot cellular automata (QCA), has the potential for attractive features such as faster speed, smaller size, and lower power consumption than tra...
Heumpil Cho, Earl E. Swartzlander Jr.
SIGCSE
1997
ACM
158views Education» more  SIGCSE 1997»
13 years 12 months ago
A collection of tools for making automata theory and formal languages come alive
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider...
ACTA
2010
104views more  ACTA 2010»
13 years 8 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CPAIOR
2009
Springer
14 years 2 months ago
Reformulating Global Grammar Constraints
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
George Katsirelos, Nina Narodytska, Toby Walsh