Filters








2,895 Hits in 4.8 sec

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection [chapter]

Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2016 Lecture Notes in Computer Science  
In this paper, we focus on the conversion of regular expressions with intersection to nondeterministic finite automata, using partial derivatives and the notion of support.  ...  Using the framework of analytic combinatorics, we then establish an upper bound of (1.056+o(1)) n for its asymptotic average-state complexity, which is significantly smaller than the one for the worst  ...  Partial Derivatives The notions of partial derivatives and partial derivative automata were introduced by Antimirov [1] for standard regular expressions.  ... 
doi:10.1007/978-3-319-41114-9_4 fatcat:cohs5m5hjzeenpplahx7mb5chq

ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED

MARCO ALMEIDA, NELMA MOREIRA, ROGÉRIO REIS
2009 International Journal of Foundations of Computer Science  
Antimirov and Mosses proposed a rewrite system for deciding the equivalence of two (extended) regular expressions.  ...  Besides an improved version of Antimirov and Mosses's algorithm, we present a version using partial derivatives.  ...  One of the advantages of using partial derivatives is that for any α ∈ RE, |P D(α) = ∂ Σ (α)| ≤ |α| Σ , where P D(α) stands for the set of all the syntactically different partial derivatives.  ... 
doi:10.1142/s0129054109006802 fatcat:pe473d5krvdebeye5ickxztfn4

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs [chapter]

Miguel Ferreira, Nelma Moreira, Rogério Reis
2018 Lecture Notes in Computer Science  
Finally, we present some experimental results comparing the size of FIFA with other automata. ?  ...  We define the class of forward injective finite automata (FIFA) and study some of their properties. Each FIFA has a unique canonical representation up to isomorphism.  ...  The conversion method used was the partial derivative automata [2] .  ... 
doi:10.1007/978-3-319-94631-3_8 fatcat:wkwq4c2rmfc35hqwsqr26f4pta

Synchronization and maximum Lyapunov exponents of cellular automata

Franco Bagnoli, Raúl Rechtman
1999 Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics  
We study the synchronization of totalistic one dimensional cellular automata (CA). The CA with a non zero synchronization threshold exhibit complex non periodic space time patterns and conversely.  ...  with the aid of the Boolean derivatives.  ...  i+r−1 ] . (7) During the time evolution of a particular CA a fixed value of µ is attained so that on averagederivatives inside the parenthesis on the r.h.s. of Eq. (7) are different from zero.  ... 
doi:10.1103/physreve.59.r1307 fatcat:mzkoavqrpfhabjoaoqabgnjhtu

Diagnosability degree of stochastic discrete event systems

Hugo Bazille, Eric Fabre, Blaise Genest
2017 2017 IEEE 56th Annual Conference on Decision and Control (CDC)  
Diagnosability is the ability to detect a fault from partial observations collected on a system.  ...  For the diagnosable part of a system, that we characterize, we then examine the probability distribution of the detection delay.  ...  The authors would like to thank Arthur Queffelec who contributed to the early exploration of these ideas.  ... 
doi:10.1109/cdc.2017.8264524 dblp:conf/cdc/BazilleFG17 fatcat:gxkenyeg2nfw5gypofz35idagy

Minimization of Automata [article]

Jean Berstel and Luc Boasson and Olivier Carton and Isabelle Fagnot
2010 arXiv   pre-print
In particular, we show that it is not possible to simulate the computations of one of the algorithm by the other. We describe the minimization algorithm by fusion for so-called local automata.  ...  This chapter is concerned with the design and analysis of algorithms for minimizing finite automata.  ...  We thank Narad Rampersad for his careful reading of the text.  ... 
arXiv:1010.5318v3 fatcat:4lxdihuhczdrxminetydrzovba

Subject index volumes 1–200

1999 Theoretical Computer Science  
of satisfiability, 3246 partial confluence of basic semi-Thue systems, 3681 problem, 3230 properties of the transformation semigroups of automata, 1836 regularity, 1644 satisfaction of guards,  ...  trellis automata, 580 upper bounds on descriptional complexity, 446 space complexity of SAT, 431 the complexity of decision problems, 535 upper bounds polynomial -, 208 1, 2302 topological -,  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Abstracts of Current Computer Literature1 (415) 1623

1971 IEEE transactions on computers  
, and many of the properties of these grammars are derived. 9157 Cellular Automata Complexity Trade-Offs, A.  ...  By extending the behavior diagram so that it can also be used to model the behavioral aspects of control networks, a framework is provided for deriving the main results of this paper, namely, a set of  ... 
doi:10.1109/t-c.1971.223194 fatcat:hh2wp6alenexvpphuet7losv7e

Induction of Subgoal Automata for Reinforcement Learning [article]

Daniel Furelos-Blanco, Mark Law, Alessandra Russo, Krysia Broda and Anders Jonsson
2019 arXiv   pre-print
Finally, we analyze the running time and the number of traces that ISA needs to learn an automata, and the impact that the number of observable events has on the learner's performance.  ...  Our method relies on inducing an automaton whose transitions are subgoals expressed as propositional formulas over a set of observable events.  ...  Acknowledgments Anders Jonsson is partially supported by the Spanish grants TIN2015-67959 and PCIN-2017-082.  ... 
arXiv:1911.13152v1 fatcat:h7vthmu54vdr5jkswajeoeckpu

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
New results are obtained on the proper selection of a tail machine. Efficient techniques for the cascade decomposition of some classes of semi-automata are discussed.  ...  The relationship between automata behavior and the algebraic structuire of their semi-automata is considered.  ... 
doi:10.1109/tc.1968.226455 fatcat:syhwt24pazahde6pjqsan47epq

A Statistical Model Checker for Nondeterminism and Rare Events [chapter]

Carlos E. Budde, Pedro R. D'Argenio, Arnd Hartmanns, Sean Sedwards
2018 Lecture Notes in Computer Science  
As part of the Modest Toolset, it supports a variety of input formalisms natively and via the Jani exchange format.  ...  Statistical model checking avoids the state space explosion problem in verification and naturally supports complex non-Markovian formalisms.  ...  The authors thank Carina Pilch and Sebastian Junges for their support with the vehicle charging and wireless networks case studies. Data Availability.  ... 
doi:10.1007/978-3-319-89963-3_20 fatcat:iiagsuebc5e7zgop3qniaxspvm

Cellular Automata for Bus Dynamics [chapter]

Ding-wei Huang, Wei-neng Huang
2011 Cellular Automata - Simplicity Behind Complexity  
It is therefore concluded that the posted average time-headway is of not much help for the passengers expecting the next bus at the bus stop.  ...  For example, in a schedule of ΔT = M + 1, the bus must be delayed in one of the M bus stops.  ...  The feature of simplicity behind complexity of cellular automata has attracted the researchers' attention from a wide range of divergent fields of study of science, which extend from the exact disciplines  ... 
doi:10.5772/16206 fatcat:e7outyvpyvgcnjbrhbazvncily

Spatially extended populations reproducing logistic map

Witold Dzwinel
2010 Open Physics  
We concluded that the global logistic behavior can be expected for a spatially extended colony with high mobility of individuals whose microscopic behavior is governed by a specific semi-logistic rule  ...  We found the class of "atomistic" rules for which uncorrelated spatially extended population matches the logistic map both for pre-chaotic and chaotic modes.  ...  Acknowledgements This research is financed by the Polish Ministry of Education and Science, Project No.3 T11F 010 30.  ... 
doi:10.2478/s11534-009-0089-6 fatcat:kkjltoxc7bf7ve5gte3ta7uohm

System Testing of Timing Requirements Based on Use Cases and Timed Automata

Chunhui Wang, Fabrizio Pastore, Lionel Briand
2017 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)  
Initial empirical results based on an industrial case study provide evidence of the effectiveness of the approach.  ...  In the context of use-case centric development and requirements-driven testing, this paper addresses the problem of automatically deriving system test cases to verify timing requirements.  ...  It is employed for the generation of test cases that include both inputs derived from use case specifications and timing constraint on the inputs, e.g. the delay between two inputs, derived from timed  ... 
doi:10.1109/icst.2017.34 dblp:conf/icst/WangPB17 fatcat:dugcfkd5xravxivaq6orvzrity

Induction of Subgoal Automata for Reinforcement Learning

Daniel Furelos-Blanco, Mark Law, Alessandra Russo, Krysia Broda, Anders Jonsson
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Finally, we analyze the running time and the number of traces that ISA needs to learn an automata, and the impact that the number of observable events have on the learner's performance.  ...  Our method relies on inducing an automaton whose transitions are subgoals expressed as propositional formulas over a set of observable events.  ...  Acknowledgments Anders Jonsson is partially supported by the Spanish grants TIN2015-67959 and PCIN-2017-082.  ... 
doi:10.1609/aaai.v34i04.5802 fatcat:duhdw2un4fgv7mfbujt4jftf7a
« Previous Showing results 1 — 15 out of 2,895 results