Filters








7,707 Hits in 2.2 sec

An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata

Madoda Nxumalo, Derrick G Kourie, Loek Cleophas, Bruce W Watson
<span title="2017-07-08">2017</span> <i title="South African Institute of Computer Scientists and Information Technologists"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/f66jynflfrcsjpsun64gewa7pi" style="color: black;">South African Computer Journal</a> </i> &nbsp;
Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs).  ...  A first suite of test data consists of DFAs that recognise randomised sets of finite length keywords.  ...  INTRODUCTION Deterministic finite automata (DFAs) are widely studied and used in Computer Science.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18489/sacj.v29i1.456">doi:10.18489/sacj.v29i1.456</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vsluvfz5dzgmfp3npzbytxhmru">fatcat:vsluvfz5dzgmfp3npzbytxhmru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721235254/http://sacj.cs.uct.ac.za/index.php/sacj/article/download/456/207" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a9/7c/a97cf77c69de3d3f92f5fa31886a41fed4b11878.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18489/sacj.v29i1.456"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Page 1204 of Mathematical Reviews Vol. , Issue 97B [page]

<span title="">1997</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We consider cases of single failures of transitions and states of automata.  ...  The no- tion is a generalization of the known notion of word derivative due to Brzozowski: partial derivatives are related to non-deterministic finite automata (NFAs) in the same natural way as derivatives  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1997-02_97b/page/1204" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1997-02_97b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A General Weighted Grammar Library [chapter]

Cyril Allauzen, Mehryar Mohri, Brian Roark
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions.  ...  The utility grmlocalgrammar takes as input a deterministic finite automaton A and returns a deterministic finite automaton recognizing Σ * A represented with failure transitions.  ...  Fig. 1 . 1 (a) A deterministic finite automaton A and (b) a deterministic automaton recognizing Σ * A where transitions labeled with φ are failure transitions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30500-2_3">doi:10.1007/978-3-540-30500-2_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c7yledffdfda3pd4hc7redgcdy">fatcat:c7yledffdfda3pd4hc7redgcdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060823043629/http://www.cs.nyu.edu:80/~allauzen/pdf/ngrm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/2e/212e75897349572e8cc30dfb987d080cbfb9edd5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30500-2_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Expressiveness and Closure Properties for Quantitative Languages

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cnybbxuptncftdgxtodn5edz7m" style="color: black;">2009 24th Annual IEEE Symposium on Logic In Computer Science</a> </i> &nbsp;
We first show that the set of words with value greater than a threshold can be non-ω-regular for deterministic limit-average and discounted-sum automata, while this set is always ω-regular when the threshold  ...  Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w).  ...  The lattice automata of [20] map finite words to values from a finite lattice.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2009.16">doi:10.1109/lics.2009.16</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lics/ChatterjeeDH09.html">dblp:conf/lics/ChatterjeeDH09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s452y64mlfegdh2c4omt3visdy">fatcat:s452y64mlfegdh2c4omt3visdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922231553/https://repository.ist.ac.at/55/1/Expressiveness_Closure_Properties_Quantitative_Languages.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/68/ec687abea66e94958e3c0ffd1cf1f9c8bf561d71.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lics.2009.16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Efficient inclusion checking for deterministic tree automata and XML Schemas

Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
<span title="">2009</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(|A| · | | · |D|).  ...  We present algorithms for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| · |B|) where B is deterministic (bottom-up or top-down).  ...  Acknowledgments We thank Sławek Staworko for having pointed out the alternative algorithm for inclusion checking for top-down deterministic tree automata and its relevance for DTDs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2009.03.003">doi:10.1016/j.ic.2009.03.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bkuqrxuctvhltjbqwlbbydm7cu">fatcat:bkuqrxuctvhltjbqwlbbydm7cu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171004132910/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/e07/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwOTAwMDcwNA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/52/2e52bad1950e61ac3dac72b085fe86ff0469b4ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2009.03.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography [chapter]

Alexandre Petrenko
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
P.: Failure Diagnosis of Automata. Cybernetics. Plenum Publishing Corporation.  ...  Trace inclusion, trace e quivalence, failure r eduction, failure e quivalence, or nondeterminism reduction.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45510-8_10">doi:10.1007/3-540-45510-8_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u3v5e4762bctznu4zcvfm5t7e4">fatcat:u3v5e4762bctznu4zcvfm5t7e4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030715114510/http://selab.korea.ac.kr:80/~eastwing/resrc/Petrenko00.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/ea/e2ea676647d0f457e4882be1b5670f247c67ec7e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45510-8_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Airwolf-TG: A test generator for assertion-based dynamic verification

Jason G. Tong, Marc Boule, Zeljko Zilic
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4xfhwkuqw5f43mad6ock55mkeu" style="color: black;">2009 IEEE International High Level Design Validation and Test Workshop</a> </i> &nbsp;
We present algorithms in Airwolf-TG that generate test sequences from efficient and compact automata produced by MBAC tool. 106 978-1-4244-4823-4/09/$25.00  ...  Such tests are aimed at finding failures in corner-case scenarios of the design specification that test generation alone, without assertions, may not be able to achieve.  ...  Deterministic Finite Automata (DFA) contain distinct, mutually exclusive Boolean conditions in which the automata can enter only one active state at a time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hldvt.2009.5340166">doi:10.1109/hldvt.2009.5340166</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hldvt/TongBZ09.html">dblp:conf/hldvt/TongBZ09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gcby5sljoratjgivcllwy3ijja">fatcat:gcby5sljoratjgivcllwy3ijja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401091631/http://www.iml.ece.mcgill.ca/people/professors/zilic/documents/jaytpg.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/89/4589fef7fb5fd9a2d75e4850e70e3c97d8601183.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hldvt.2009.5340166"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 1542 of Mathematical Reviews Vol. , Issue 88c [page]

<span title="">1988</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Buls], A bound for the length of a word in the modeling of deterministic finite automata (pp. 50- 63, 191, 198); A. A. Kalis [A.  ...  Taimina], On the number of states of finite automata that recognize the equality of w-words (pp. 46-49, 191, 198); Ya. A. Buls [J.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1988-03_88c/page/1542" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1988-03_88c/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Quantitative languages

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
<span title="2010-07-01">2010</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3kjjbv4edjbezl2w37ipy5lo5a" style="color: black;">ACM Transactions on Computational Logic</a> </i> &nbsp;
We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite  ...  We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized.  ...  Deterministic coBüchi automata cannot be reduced to deterministic LimSup-automata.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1805950.1805953">doi:10.1145/1805950.1805953</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijem6ycq3rcghiunkq7muluo6y">fatcat:ijem6ycq3rcghiunkq7muluo6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830073709/http://www.lsv.fr/~doyen/papers/Quantitative_Languages_J.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/f7/13f790f4ca8ff0cfb53986955d359744ecb1a8a9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1805950.1805953"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY

CYRIL ALLAUZEN, MEHRYAR MOHRI, BRIAN ROARK
<span title="">2005</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhcgkcmjlvfovferf3in5mkmpq" style="color: black;">International Journal of Foundations of Computer Science</a> </i> &nbsp;
The algorithms and the utilities were designed to support a wide variety of semirings and the representation and use of large grammars and automata of several hundred million rules or transitions.  ...  The library utility grmlocalgrammar takes as input a deterministic finite automaton A and returns a deterministic finite automaton recognizing Σ * L(A) represented with failure transitions.  ...  with other finite automata and finite-state transducers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054105003066">doi:10.1142/s0129054105003066</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l5ldxhid6na2tfwoycwvckbpey">fatcat:l5ldxhid6na2tfwoycwvckbpey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809120913/http://tagh.de/tom/wp-content/uploads/wgrm.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/6b/196b2aa22769a4533e5f996dfb5c8b844e23b917.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054105003066"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

A Memory Efficient Regular Expression Matching by Compressing Deterministic Finite Automata

Utkarsha P.Pisolkar, Shivaji R. Lahane
<span title="2015-07-18">2015</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
A massive amount of memory is essential to store transition function of Deterministic finite automata.  ...  Deterministic finite automaton is often used to represent regular expressions. In regular expression matching, storage space of Deterministic finite automata is very important concern.  ...  This method has four main phases as Regular expression to Non-Deterministic finite automata (NFA) conversion, NFA to DFA conversion, DFA compression and matching on DFA.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/21815-5143">doi:10.5120/21815-5143</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3m5yqovdd5ebjklqctqlebouqa">fatcat:3m5yqovdd5ebjklqctqlebouqa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922211115/http://research.ijcaonline.org/volume122/number20/pxc3905143.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a9/c3/a9c36cd203377af50bc753fe8811e5b609c690ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/21815-5143"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Transfer Model Based on State of Finite Semi-Markov Automata Intrusion Tolerance

Wang Guangze, Wang Peng, Luo Zhiyong, Zhu Suxia
<span title="2016-03-31">2016</span> <i title="Science and Engineering Research Support Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4h7flaxsjnh6he3qbiwvxbekxe" style="color: black;">International Journal of Security and Its Applications</a> </i> &nbsp;
On the basis of existing model of intrusion tolerance, we putted forward an optimization of finite automata state transition model in intrusion tolerance system by adding strategy and updating status.  ...  automata intrusion tolerant system is feasible, effective, and has simple features.  ...  Finite Automata Analysis Intrusion Tolerance System Finite state automaton is a control limited and finite symbol automaton, which is divided into deterministic finite automata (DFSA) [7] and non-deterministic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijsia.2016.10.3.14">doi:10.14257/ijsia.2016.10.3.14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x2m4muebk5ep7omo75i3beldxm">fatcat:x2m4muebk5ep7omo75i3beldxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180603005947/http://www.sersc.org/journals/IJSIA/vol10_no3_2016/14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/cf/e7cf08fca5cb1851f1ec28a1316276f5a3f55695.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijsia.2016.10.3.14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Expressiveness and Closure Properties for Quantitative Languages [article]

Krishnendu Chatterjee and Laurent Doyen and Thomas A. Henzinger
<span title="2009-05-13">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We first show that the set of words with value greater than a threshold can be non-ω-regular for deterministic limit-average and discounted-sum automata, while this set is always ω-regular when the threshold  ...  Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w).  ...  The lattice automata of [KL07] map finite words to values from a finite lattice.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0905.2195v1">arXiv:0905.2195v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j7zclnarwrdehdjwk4tiz4doha">fatcat:j7zclnarwrdehdjwk4tiz4doha</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0905.2195/0905.2195.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0905.2195v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Expressiveness and Closure Properties for Quantitative Languages

Krishnendu Chatterjee, Laurent Doyen, Thomas Henzinger, Prakash Panangaden
<span title="2010-08-30">2010</span> <i title="Logical Methods in Computer Science e.V."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c67srop7pbe3nciquoxzy3d6pm" style="color: black;">Logical Methods in Computer Science</a> </i> &nbsp;
We first show that the set of words with value greater than a threshold can be non-ω-regular for deterministic limit-average and discounted-sum automata, while this set is always ω-regular when the threshold  ...  We next consider automata with transition weights Weighted automata are nondeterministic automata with numerical weights ontransitions.  ...  The lattice automata of [KL07] map finite words to values from a finite lattice.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-6(3:10)2010">doi:10.2168/lmcs-6(3:10)2010</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/52egwusycrb7likdnggu3dmcs4">fatcat:52egwusycrb7likdnggu3dmcs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721141106/https://lmcs.episciences.org/1084/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/5f/6a5f52afebc8728ead0a0e8db9a287360230e2fc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-6(3:10)2010"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Page 6943 of Mathematical Reviews Vol. , Issue 95k [page]

<span title="">1995</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
automata (note that alternating finite automata recognize only regular languages [A.  ...  Since P corresponds to alternating multihead finite automata [A. K. Chandra, D. C. Kozen and L. J.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1995-11_95k/page/6943" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1995-11_95k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 7,707 results