Sciweavers

426 search results - page 68 / 86
» Synchronization of Regular Automata
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Decidability in Syntactic Control of Interference
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
James Laird
STACS
1991
Springer
13 years 11 months ago
On Aperiodic Trace Languages
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
Giovanna Guaiana, Antonio Restivo, Sergio Salemi
COLING
1996
13 years 9 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
DAM
2008
69views more  DAM 2008»
13 years 7 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...