Results 41 to 50 of about 92,067 (341)

Automaton semigroup constructions [PDF]

Semigroup Forum, 2014
13 pages; 2 ...
Brough, Tara, Cain, Alan J.
openaire   +2 more sources

Deterministic automata for extended regular expressions

Open Computer Science, 2017
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement.
Syzdykov Mirzakhmet
doaj   +1 more source

Reducing Clocks in Timed Automata while Preserving Bisimulation

, 2014
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible.
Arun-Kumar, S., Guha, Shibashis, Narayan, Chinmay   +2 more
core   +1 more source

Damaging 2D Quantum Gravity

, 1993
We investigate numerically the behaviour of damage spreading in a Kauffman cellular automaton with quenched rules on a dynamical $\phi^3$ graph, which is equivalent to coupling the model to discretized 2D gravity.
Ambjørn, Ambjørn, Baillie, Baillie, Boulatov, Boulatov, C.F. Baillie, Catterall, Catterall, Coniglio, D.A. Johnston, David, Derrida, Derrida, Derrida, Derrida, Distler, Domany, Flyvbjerg, Flyvbjerg, Gel'Fand, Hilhorst, Jurkiewicz, Kauffman, Kauffman, Kauffman, Kawai, Kazakov, Kazakov, Keller, Knizhnik, Stauffer, Stauffer, Wolfram   +33 more
core   +1 more source

Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching [PDF]

, 2013
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating ...
862, 863, 864, Matsuzaki, Kiminori, Sassa, Masataka, Sin'ya, Ryoma   +5 more
core   +2 more sources

Graph Spectral Properties of Deterministic Finite Automata

, 2014
We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of
A. Goldberg, A. Nerode, C. Choffrut, J. Sakarovitch, P.V. Mieghem, S.M. Osnaga   +5 more
core   +1 more source

Experimental Study of the Shortest Reset Word of Random Automata [PDF]

, 1997
In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing ...
Appelshauser, H., Bachler, J., Bailey, S.J., Barnby, L.S., Bartke, J., Barton, R.A., Bialkowska, H., Blyth, C.O., Bock, R., Bormann, C., Brady, F.P., Brockmann, R., Brun, R., Buncic, P., Caines, H.L., Cebra, D.A., Cooper, G.E., Cramer, J.G., Csato, P., Dunn, J., Eckardt, V., Eckhardt, F., Ferguson, M.I., Fischer, H.G., Flierl, D., Fodor, Z., Foka, P., Freund, P., Friese, V., Fuchs, M., Gabler, F., Gal, J., Gazdzicki, M., Gladysz, E., Grebieszkow, J., Gunther, J., Harris, J.W., Hegyi, S., Henkel, T., Hill, L.A., Huang, I., Hummler, H., Igo, G., Irmscher, D., Jacobs, P., Jones, P.G., Kadija, K., Kolesnikov, V.I., Kowalski, M., Lasiuk, B., Levai, P., Malakhov, A.I., Margetis, S., Markert, C., Melkumov, G.L., Mock, A., Molnar, J., Nelson, John M., Odyniec, G., Oldenburg, M., Palla, G., Panagiotou, A.D., Petridis, A., Piper, A., Porter, R.J., Poskanzer, Arthur M., Poziombka, S., Prindle, D.J., Puhlhofer, F., Rauch, W., Reid, J.G., Renfordt, R., Retyk, W., Ritter, H.G., Rohrich, D., Roland, C., Roland, G., Rudolph, H., Rybicki, A., Sandoval, A., Sann, H., Schafer, E., Schmischke, D., Schmitz, N., Schonfelder, S., Semenov, A.Yu., Seyboth, P., Seyerlein, J., Sikler, F., Skrzypczak, E., Squier, G.T.A., Stock, R., Strobele, H., Szentpetery, I., Sziklai, J., Toy, M., Trainor, T.A., Trentalange, S., Ullrich, T., Vassiliou, M., Vesztergombi, G., Voloshin, S., Vranic, D., Wang, F., Weerasundara, D.D., Wenig, S., Whitten, C., Wienold, T., Wood, L., Yates, T.A., Zimanyi, J., Zybert, R.   +111 more
core   +2 more sources

The anti‐CRISPR protein AcrIE8.1 inhibits the type I‐E CRISPR‐Cas system by directly binding to the Cascade subunit Cas11

FEBS Letters, EarlyView.
In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley   +1 more source

Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems [PDF]

, 2016
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems. In DIOA, automata can be created and destroyed dynamically, as computation proceeds, and an automaton can dynamically change its signature, i.e., the set of actions in ...
Attie, Paul C., Lynch, Nancy A.
core   +2 more sources

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

FEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source