Filters








3,268 Hits in 5.5 sec

Short Regular Expressions from Finite Automata: Empirical Results [chapter]

Hermann Gruber, Markus Holzer, Michael Tautschnig
<span title="">2009</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;
Holzer: Provably shorter regular expressions from deterministic finite automata (extended abstract). In Proc.  ...  regular expressions.  ...  Recently improved upper bounds on the size of the regular expressions resulting from deterministic finite automata (DFA) over small alphabets were obtained [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-02979-0_22">doi:10.1007/978-3-642-02979-0_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46b7oliwrjcinekkxnv3rvftce">fatcat:46b7oliwrjcinekkxnv3rvftce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809151240/http://www.hermann-gruber.com/data/ciaa09-final.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/1c/af/1cafd05470bc09cdb023ebfe4881e75d5f5b4140.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-642-02979-0_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Automata-based Quantitative Verification [article]

Suguman Bansal
<span title="2020-10-05">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The introduced framework, called comparator automata or comparators in short, builds on automata-theoretic foundations to generalize across a variety of cost models.  ...  Most algorithms comprise of a structural phase which reasons about the structure of the quantitative system(s) using techniques from automata or graphs, and a numerical phase, which reasons about the quantitative  ...  bound of µ C = µ· d d−1 on the resulting expression.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.02055v1">arXiv:2010.02055v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jynqpn2msrdi5j72t3fm6yuiti">fatcat:jynqpn2msrdi5j72t3fm6yuiti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201118232644/https://arxiv.org/pdf/2010.02055v1.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/96/e5/96e5ca6ae0a589cb4736275fb8cace4920582d47.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2010.02055v1" 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>

Sequential Neural Networks as Automata [article]

William Merrill
<span title="2021-01-04">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This work attempts to explain the types of computation that neural networks can perform by relating them to automata.  ...  A measure of network memory follows from this definition. We then characterize the classes of languages acceptable by various recurrent networks, attention, and convolutional networks.  ...  It also follows from Theorem 3.1 that the languages asymptotically acceptable by an SRN are a subset of the finite-state (i.e. regular) languages.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.01615v3">arXiv:1906.01615v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/me5vvdzhvrcatmrgjr4m5eyqiu">fatcat:me5vvdzhvrcatmrgjr4m5eyqiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210112092631/https://arxiv.org/pdf/1906.01615v3.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/a1/19/a1194cf4cb4d1e43ac6b03fb583709eb905c3c1c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1906.01615v3" 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>

Codification schemes and finite automata

Penélope Hernández, Amparo Urbano
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/voowybrx3nfvlmrxrcu5ixa3wa" style="color: black;">Mathematical Social Sciences</a> </i> &nbsp;
More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman's (1998) work on finitely repeated games played by finite automata.  ...  This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games  ...  Result 1: Let V be a subset of sequences of length k over a finite alphabet Θ = {0, 1} with empirical rational distribution (r, 1 − r) ∈ ∆(Θ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.mathsocsci.2008.01.007">doi:10.1016/j.mathsocsci.2008.01.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jirdp47mvvapvfvv7ky4ad4l7i">fatcat:jirdp47mvvapvfvv7ky4ad4l7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171206175939/https://core.ac.uk/download/pdf/6508981.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/33/ec335fbba82badc106fe30be873efb739e543fa4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.mathsocsci.2008.01.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Comparator automata in quantitative verification [article]

Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi
<span title="2021-10-10">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This notion is embodied by comparator automata (comparators, in short), a new class of automata that read two infinite sequences of weights synchronously and relate their aggregate values.  ...  We show that aggregate functions that can be represented with Büchi automaton result in comparators that are finite-state and accept by the Büchi condition as well.  ...  Finally, we show the repercussions of the above results on quantitative inclusion with discounted-sum aggregate function (DS-inclusion, in short).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.06569v2">arXiv:1812.06569v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fsea7blvlbh3hnh4eqf7ght27m">fatcat:fsea7blvlbh3hnh4eqf7ght27m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211013152122/https://arxiv.org/pdf/1812.06569v2.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/3c/c7/3cc7daf4492b4e84bf7cad2df49c31df364e22d6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.06569v2" 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>

The Neural State Pushdown Automata [article]

Ankur Mali, Alexander Ororbia, C. Lee Giles
<span title="2019-09-19">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We empirically show its effectiveness in recognizing various context-free grammars (CFGs).  ...  Our results show that, for Dyck(2) languages, prior rule-based knowledge is critical for optimization convergence and for ensuring generalization to longer sequences at test time.  ...  In order to program and insert rules, we propose adapting methodology originally developed for second-order RNNs and deterministic finite state automata (DFA) [19] to the case of PDA-based RNNs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.05233v2">arXiv:1909.05233v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/imaxvlic4fepppsleoxw3xmez4">fatcat:imaxvlic4fepppsleoxw3xmez4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912142808/https://arxiv.org/pdf/1909.05233v2.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/6f/2e/6f2e9d357f6922c958e3b4e9595aad4107ec328a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1909.05233v2" 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>

Ramsey-Based Analysis of Parity Automata [chapter]

Oliver Friedmann, Martin Lange
<span title="">2012</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;
We compare them to Ramsey-based algorithms which are obtained from translating parity automata into Büchi automata first and then applying the known Ramsey-based analysis procedures to the resulting automata  ...  Parity automata are a generalisation of Büchi automata that have some interesting advantages over the latter, e.g. determinisability, succinctness and the ability to express certain acceptance conditions  ...  An ω-regular language or just regular language for short is a language that can be accepted by an NBA.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-28756-5_6">doi:10.1007/978-3-642-28756-5_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pchi7g4pzzamvghkibrxrnfxpi">fatcat:pchi7g4pzzamvghkibrxrnfxpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809032607/http://carrick.fmv.informatik.uni-kassel.de/~mlange/papers/tacas12.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/bd/6c/bd6c9a7731aea8b0aa84088fede5aa16ac94fc3e.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-642-28756-5_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity

Hermann Gruber, Markus Holzer
<span title="2014-05-21">2014</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956.  ...  algorithm that converts finite automata to regular expressions.  ...  From Regular Expressions to Finite Automata The conversion of regular expressions into small finite automata has been intensively studied for more than half a century.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.151.2">doi:10.4204/eptcs.151.2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xiiyglxcebbkpdklmkngqd47dm">fatcat:xiiyglxcebbkpdklmkngqd47dm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809151230/http://www.hermann-gruber.com/data/afl14-official.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/70/5f/705ffae6747ee048feb70b4fe3195c31843c2922.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.151.2"> <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>

Refining Domain Theories Expressed as Finite-State Automata [chapter]

Richard Maclin, Jude W. Shavlik
<span title="">1991</span> <i title="Elsevier"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v54jrmjbpzgodi4buoyaj7vrzm" style="color: black;">Machine Learning Proceedings 1991</a> </i> &nbsp;
Currently, domain knowledge in KBANN is expressed as nonrecursive, propositional rules. We extend KBANN to domain theories expressed as finite-state automata.  ...  algorithm from the biological literature.  ...  Finite-state KBANN represents domain theories expressed as finite-state automata.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-1-55860-200-7.50107-0">doi:10.1016/b978-1-55860-200-7.50107-0</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icml/MaclinS91.html">dblp:conf/icml/MaclinS91</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u6vjzvxys5h2jfj4dxahmqfkdi">fatcat:u6vjzvxys5h2jfj4dxahmqfkdi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160403061032/http://www.d.umn.edu/~rmaclin/publications/maclin-icml91.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/95/97/95977e3316d2b40ffb2a99b198f04f53fc01ddda.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-1-55860-200-7.50107-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Statistical equilibrium in deterministic cellular automata [article]

Siamak Taati
<span title="2015-05-24">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium  ...  The formulation is in the same vein as Boltzmann's ideas, but the simple combinatorial setup offers clarification and hope for generic mathematically rigorous results.  ...  The purpose of this chapter is to demonstrate examples of results and experimental observations regarding the so-called randomization behaviour in cellular automata (going back to Miyamoto, Wolfram and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.06464v1">arXiv:1505.06464v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pwdb5ceiondmjl76tkt6xyvkhy">fatcat:pwdb5ceiondmjl76tkt6xyvkhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824063303/https://arxiv.org/pdf/1505.06464v1.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/83/c6/83c6f8a1bfd78c10756efe947f4112ba953f72c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.06464v1" 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>

Random sequence generation by cellular automata

Stephen Wolfram
<span title="">1986</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cmpnnf7ngjdizknpclbqvvidmm" style="color: black;">Advances in Applied Mathematics</a> </i> &nbsp;
These sequences are analysed by a variety of empirical, combinatorial, statistical, dynamical systems theory and computation theory methods.  ...  Table 10 .1 gives results from the statistical tests described in Appendix A for sequences generated by the cellular automaton (3.1) in a finite circular register.  ...  The cycle structures of finite cellular automata depend in detail on the boundary conditions chosen.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0196-8858(86)90028-x">doi:10.1016/0196-8858(86)90028-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fd4menmgzffgdhut2ae3eqrwua">fatcat:fd4menmgzffgdhut2ae3eqrwua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190322155252/https://core.ac.uk/download/pdf/82617712.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/6e/9e/6e9e362179b3e55cb44b9cc4a93510b7e33754cb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0196-8858(86)90028-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Spectral learning of weighted automata

Borja Balle, Xavier Carreras, Franco M. Luque, Ariadna Quattoni
<span title="2013-10-03">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
In recent years we have seen the development of efficient provably correct algorithms for learning Weighted Finite Automata (WFA).  ...  Most of these algorithms avoid the known hardness results by defining parameters beyond the number of states that can be used to quantify the complexity of learning automata under a particular distribution  ...  These can range from the classical acceptors for regular languages like Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), to the more general Weighted Finite Automata (WFA  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-013-5416-x">doi:10.1007/s10994-013-5416-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gdkrhg3qpvcvzchkbwuw62j6ja">fatcat:gdkrhg3qpvcvzchkbwuw62j6ja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504235144/https://link.springer.com/content/pdf/10.1007%2Fs10994-013-5416-x.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/a7/c9/a7c979d386448912abe39669078e538e1ac5b757.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10994-013-5416-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Learning Communicating Automata from MSCs

Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
<span title="">2010</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dthyqga2onff5nwf4agwqtrhxi" style="color: black;">IEEE Transactions on Software Engineering</a> </i> &nbsp;
Communicating finite-state machines (CFMs), i.e., finite automata that communicate via FIFO buffers, act as system realizations.  ...  The key contribution is a generalization of Angluin's learning algorithm for synthesizing CFMs from MSCs.  ...  We extend Angluin's learning algorithm for inferring deterministic finite automata from regular languages to a learning algorithm that allows for synthesizing CFMs from MSC languages, i.e., sets of words  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tse.2009.89">doi:10.1109/tse.2009.89</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5mbmadir6rdaxp5nodnwp36o7m">fatcat:5mbmadir6rdaxp5nodnwp36o7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808223032/http://www.lsv.fr/Publis/PAPERS/PDF/BKKL-tse09.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/6b/f3/6bf3f3fb8a17e627c9e5bb94386387b4816ac5c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tse.2009.89"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Advanced automata minimization

Richard Mayr, Lorenzo Clemente
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL &#39;13</a> </i> &nbsp;
We thus obtained 300 automata and minimized them with GOAL. The resulting automata vary significantly in size from 1 state to 1722 states [2] .  ...  Introduction Nondeterministic Büchi automata are an effective way to represent and manipulate ω-regular languages, since they are closed under boolean operations.  ...  Thus, For delayed simulation, Spoiler wins if, after finitely many rounds, the following conditions are both satisfied: 1) She can visit an accepting state, and 2) She can prevent Duplicator from visiting  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2429069.2429079">doi:10.1145/2429069.2429079</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/MayrC13.html">dblp:conf/popl/MayrC13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4h3lktk2cvck3ixjm7f2wrpluu">fatcat:4h3lktk2cvck3ixjm7f2wrpluu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723131137/https://www.pure.ed.ac.uk/ws/files/8346385/1210.6624v1.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/ab/17/ab178acf744a1bfbe3357a39ba48fb79c29bb126.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2429069.2429079"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Advanced Automata Minimization [article]

Lorenzo Clemente, Richard Mayr
<span title="2012-10-24">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We tested our algorithm on Buchi automata derived from LTL-formulae, many classes of random automata and automata derived from mutual exclusion protocols, and compared its performance to the well-known  ...  automata tool GOAL.  ...  We thus obtained 300 automata and minimized them with GOAL. The resulting automata vary significantly in size from 1 state to 1722 states [2] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1210.6624v1">arXiv:1210.6624v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/76y7x7dv5be5fobkirgfah7jjm">fatcat:76y7x7dv5be5fobkirgfah7jjm</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1210.6624/1210.6624.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/1210.6624v1" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,268 results