Filters








10,185 Hits in 3.6 sec

More on Deterministic and Nondeterministic Finite Cover Automata [chapter]

Hermann Gruber, Markus Holzer, Sebastian Jakobi
2015 Lecture Notes in Computer Science  
An important contribution to the theory of finite languages are the deterministic and the recently introduced nondeterministic finite cover automata (DFCAs and NFCAs, respectively) as an alternative representation  ...  Finally, we present some results on the average size of finite cover automata.  ...  , even in the best case.  ... 
doi:10.1007/978-3-319-22360-5_10 fatcat:xezi36ob3bcirfm3ssikhhtyuq

Page 3384 of Mathematical Reviews Vol. , Issue 92f [page]

1992 Mathematical Reviews  
Summary: “This paper determines the behaviour of cellular au- tomata, including the existence of fixed points and the order of configurations, using the polynomial representation of configura- tions with  ...  {For the entire collection see MR 91k:92004.} Roland Vollmar (Karlsruhe) 92f:68126 68Q80 Nohmi, Masaya On a polynomial representation of finite linear cellular automata. Bull. Inform.  ... 

Computing rank of finite algebraic structures with limited nondeterminism [article]

Jeffrey Finkelstein
2020 arXiv   pre-print
In the case of groups, the previous best algorithm for computing rank used polylogarithmic space. We reduce the best upper bounds on the complexity of computing rank for groups and for quasigroups.  ...  The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation.  ...  If G is a finite group of order n then the minimum cardinality of a generating set is at most log n, with equality when the group is a finite elementary abelian 2-group.  ... 
arXiv:1406.0879v4 fatcat:pmnljr6a2rgitgs6lmffvtcc2u

Transition Function Complexity of Finite Automata

Māris Valdats
2019 Baltic Journal of Modern Computing  
This paper considers the state assignment problem of finite automata from the complexity point of view.  ...  A new complexity measure for finite automata and regular languages, BCcomplexity, is introduced, which essentially is the circuit complexity of the transition function of the automaton.  ...  BC-complexity is then compared to the state and nondeterministic state complexities of finite automata.  ... 
doi:10.22364/bjmc.2019.7.3.02 fatcat:lxubxil3njhclboqufsxgw5swm

Recent Trends in Descriptional Complexity of Formal Languages

Martin Kutrib, Giovanni Pighizzini
2013 Bulletin of the European Association for Theoretical Computer Science  
First of all, I warmly thank my predecessor, Arto Salomaa, which was responsible of the column for many years.  ...  Dear Reader, welcome to the Formal Language Theory Column! Starting from this issue, I am the new editor of this column.  ...  In order to be general, we first formalize the intuitive notion of a representation or description of a family of languages.  ... 
dblp:journals/eatcs/KutribPP13 fatcat:cnvr3fqe6bgsfhghh45uqtwysm

Nondeterministic State Complexity of Star-Free Languages [chapter]

Markus Holzer, Martin Kutrib, Katja Meckel
2011 Lecture Notes in Computer Science  
We investigate the nondeterministic state complexity of several operations on finite automata accepting star-free languages.  ...  This nicely complements the results recently obtained in [8] for the operation problem of star-free languages accepted by deterministic finite automata.  ...  It is well known that nondeterministic and deterministic finite automata are computationally equivalent.  ... 
doi:10.1007/978-3-642-22256-6_17 fatcat:hykuruuj3nh53eyx7gxbsmtfc4

Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) [chapter]

J.J.M.M. Rutten
1999 Lecture Notes in Computer Science  
[Brz64] notion of input derivative: the input derivative aa of a series a can intuitively be understood as the specification of the behaviour of a after the input a has been accepted.  ...  For instance, the following behavioural differential equation defines the input derivative (a II T)a of the so-called shuffle product of a and r in terms of the input derivatives of a and r: (a II r)a  ...  Rational series We recall the notion of rational series, and illustrate the need of nondeterministic automata with multiplicities in k in order to obtain finite representations for them.  ... 
doi:10.1007/3-540-48523-6_61 fatcat:vy4zavldsfahpa5rbwq7nnm2na

Finding Lower Bounds for Nondeterministic State Complexity Is Hard [chapter]

Hermann Gruber, Markus Holzer
2006 Lecture Notes in Computer Science  
as minimizing nondeterministic finite automata.  ...  It is shown that the maximal attainable lower bound for each of the above mentioned techniques can be algorithmically deduced from a canonical finite graph, the so called dependency graph of a regular  ...  Acknowledgments Thanks to Martin Kutrib for some discussion on the subject during the early stages of the paper.  ... 
doi:10.1007/11779148_33 fatcat:2ofrviptb5cglpdckgwahapvgy

The Representation of Facts in Physical Theories [chapter]

Hans Primas
1997 Time, Temporality, Now  
The purpose of this contribution is to call attention to a problem which has not received the interest which, in my opinion, it deserves: the problem of representation of facts in physical theories.  ...  Such a representation removes the main stumbling block which stands in the way of a fundamental theory of measurement in quantum theory.  ...  Acknowledgment I thank Harald Atmanspacher for many discussions about the topics presented in this article.  ... 
doi:10.1007/978-3-642-60707-3_18 fatcat:ctxgaozixnbojpkvvgwsmxidyy

Reachability Games and Game Semantics: Comparing Nondeterministic Programs

Andrzej S. Murawski
2008 Logic in Computer Science  
Our decidability results rely on a representation theorem for nondeterministic strategies which, for a given term, yields a single (finite or visibly pushdown) automaton capturing both traces and divergences  ...  In fact we give a complete classification of the complexity of may-and must-approximation for fragments of EIA f of bounded type order (for terms in β-normal form).  ...  order and the availability of recursion [32, 27, 28, 31, 29] .  ... 
doi:10.1109/lics.2008.24 dblp:conf/lics/Murawski08 fatcat:yyq7wzoqmvemdns2sw3vggm4yy

MSO definable string transductions and two-way finite state transducers [article]

Joost Engelfriet, Hendrik Jan Hoogeboom
1999 arXiv   pre-print
Nondeterministic mso definable string transductions (i.e., those definable with the use of parameters) correspond to compositions of two nondeterministic two-way finite state transducers that have the  ...  String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers.  ...  The equivalence of aperiodic finite state automata and first-order logic was established in [MNPa71] .  ... 
arXiv:cs/9906007v1 fatcat:3lvlzq6tuncbzgp5kdgzq4v7pa

Complexity of multi-head finite automata: Origins and directions

Markus Holzer, Martin Kutrib, Andreas Malcher
2011 Theoretical Computer Science  
two-way finite automata, regardless of whether they work deterministically or nondeterministically.  ...  An example of this kind is the well-known result that one-way nondeterministic finite automata can offer exponential state savings compared to one-way deterministic finite automata, that is, given an n-state  ...  On the other hand, two-way deterministic and nondeterministic multi-head finite automata are probably best known to characterize the complexity classes of deterministic and nondeterministic logarithmic  ... 
doi:10.1016/j.tcs.2010.08.024 fatcat:yjkjor7r5rawrjijnxihcdnuve

LR Rotation Rule for Creating Minimal NFA

Himanshu Pandey, V. K Singh, Neeraj Kumar Verma
2015 International Journal of Applied Information Systems  
In [1] Ilie and Yu describe a construction of a right invariant equivalence relation on the states of a nondeterministic finite state automaton.  ...  We conceive the problem of reducing the number of state and transition of Non Deterministic Finite Automata.  ...  The number of states of the resulting NFA depends on the order in which the states are merged.  ... 
doi:10.5120/ijais15-451324 fatcat:qrcn3qlzkfcyro5tttz2e7bepe

The complexity of optimizing finite-state transducers

Craig A. Rich, Giora Slutzki
1994 Theoretical Computer Science  
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states are either maximizing or minimizing.  ...  The ranges of optimizing finite-state transducers form a class in NL which includes a hierarchy based on the number of alternations of maximizing and minimizing states in a computation.  ...  gt and define an ordering of representations by l,r, < 12r2 iff 1r < I2 V (11 = l2 A rl CT*).  ... 
doi:10.1016/0304-3975(94)90032-9 fatcat:bisowkfg65fzdjkyd24dd62jyy

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm [chapter]

Jiří Wiedermann
2014 Lecture Notes in Computer Science  
The results pose exciting questions concerning the relation of the complexity of deterministic versus nondeterministic algorithms for matrix multiplication, and complexity of integer versus real matrices  ...  We design two nondeterministic algorithms for matrix multiplication. Both algorithms are based on derandomization of Freivalds' algorithm for verification of matrix products.  ...  This research was partially supported by RVO 67985807 and the GAČR grant No. P202/10/1333.  ... 
doi:10.1007/978-3-662-44602-7_11 fatcat:v4uqc37hnva3flcnp64dlma6ra
« Previous Showing results 1 — 15 out of 10,185 results