Filters








2,198 Hits in 2.3 sec

Unambiguous Constrained Automata [chapter]

Michaël Cadilhac, Alain Finkel, Pierre McKenzie
<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;
The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA.  ...  Unambiguous CA are then shown incomparable with deterministic reversal-bounded machines in terms of expressivity, and a deterministic model equivalent to unambiguous CA is identified.  ...  particular in the open problems dealing with unambiguous finite automata [4] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31653-1_22">doi:10.1007/978-3-642-31653-1_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ke64zflzgbes5hn4jljqdhag2i">fatcat:ke64zflzgbes5hn4jljqdhag2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130107225808/http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFM-dlt12.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/f0/17/f017f29e497fad10b149c5cc3b8d50221618d147.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-31653-1_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

UNAMBIGUOUS CONSTRAINED AUTOMATA

MICHAËL CADILHAC, ALAIN FINKEL, PIERRE MCKENZIE
<span title="">2013</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 class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA.  ...  Unambiguous CA are then shown incomparable with deterministic reversal-bounded machines in terms of expressivity, and a deterministic model equivalent to unambiguous CA is identified.  ...  particular in the open problems dealing with unambiguous finite automata [4] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054113400339">doi:10.1142/s0129054113400339</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m6hixrt42ra65c5ivugqrtgcui">fatcat:m6hixrt42ra65c5ivugqrtgcui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130107225808/http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CFM-dlt12.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/f0/17/f017f29e497fad10b149c5cc3b8d50221618d147.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0129054113400339"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Unambiguity in Timed Regular Languages: Automata and Logics [chapter]

Paritosh K. Pandya, Simoni S. Shah
<span title="">2010</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;
these as Timed Unambiguous Languages (TUL).  ...  Unambiguous languages (UL), originally defined by Schutzenberger using unambiguous polynomials, are a robust subclass of regular languages.  ...  We call the languages accepted by these automata as timed unambiguous languages (TUL).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15297-9_14">doi:10.1007/978-3-642-15297-9_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dqjhqbzobrbu5iz7zcr3mh6uba">fatcat:dqjhqbzobrbu5iz7zcr3mh6uba</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228051549/http://pdfs.semanticscholar.org/86af/19cdfdcc6099e228bb1d2c25cf3162fbd7ba.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/86/af/86af19cdfdcc6099e228bb1d2c25cf3162fbd7ba.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-15297-9_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata [chapter]

Nicolas Bousquet, Christof Löding
<span title="">2010</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 consider the inclusion and equivalence problem for unambiguous Büchi automata.  ...  We show that for a strong version of unambiguity introduced by Carton and Michel these two problems are solvable in polynomial time.  ...  The accepting paths for ultimately periodic words are not as constrained in strongly k-ambiguous automata as they are in strongly unambiguous automata, but there is a similar characterization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13089-2_10">doi:10.1007/978-3-642-13089-2_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wx5abl6o7ffh3idls3q73rtp2y">fatcat:wx5abl6o7ffh3idls3q73rtp2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401030726/http://www-i7.informatik.rwth-aachen.de/download/papers/loeding/BL-LATA10.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/fa/15/fa159223dd854518d1bf80fec2bfb11a415351a2.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-13089-2_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Unambiguity in Automata Theory [chapter]

Thomas Colcombet
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we will investigate the nature of unambiguity in automata theory, presenting the cases of standard finite words up to infinite trees, as well as data-words and tropical automata.  ...  Our goal is to show how this notion of unambiguity is so far not well understood, and how embarrassing open questions remain open.  ...  This includes unambiguous non-finite state machines (such as pushdown automata, see e.g., [17, 31] or less standard forms of automata such as constrained automaton in [6] ) or unambiguous regular expressions  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-19225-3_1">doi:10.1007/978-3-319-19225-3_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wncinjdfmfc6ne4u4pkfy7gjoe">fatcat:wncinjdfmfc6ne4u4pkfy7gjoe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228120754/http://pdfs.semanticscholar.org/91b2/f1d56d1cdd238ebf466386d7585d9e6081df.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/91/b2/91b2f1d56d1cdd238ebf466386d7585d9e6081df.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-319-19225-3_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Robust Interpretation of Duration Calculus [chapter]

Martin Fränzle, Michael R. Hansen
<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;
As embedded systems become more and more complex, early availability of unambiguous specification of their intended behaviour has become an important factor for quality and timely delivery.  ...  The price to be paid for such procedures is, however, a firmly constrained expressiveness of the specification formalisms: one has to sacrifice all elements that could give rise to undecidability.  ...  As embedded systems become more and more complex, early availability of unambiguous specification of their intended behaviour has become an important factor for quality and timely delivery.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560647_17">doi:10.1007/11560647_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e7rsobcoanfq5d5igyxzjalbea">fatcat:e7rsobcoanfq5d5igyxzjalbea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921220738/http://www2.imm.dtu.dk/pubdb/views/edoc_download.php/3350/pdf/imm3350.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/9b/88/9b888e42750ed4ed0ffba0bc676bafe4d0ce56da.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11560647_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Adaptive Pattern Matching

R. C. Sekar, R. Ramesh, I. V. Ramakrishnan
<span title="">1995</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
The design of such adaptive automata is the focus of this paper. In this context we study several important problems that have remained open even for automata based on left-to-right traversals.  ...  Such problems include upper and lower bounds on space complexity, construction of optimal dag automata and impact of typing in pattern matching.  ...  For instance, it appears that the patterns used in the lower bound proof on size of tree automata for unambiguous patterns, possess a polynomial-size dag automaton.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s0097539793246252">doi:10.1137/s0097539793246252</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i7ikubw5lzaq5peabmksi6vgtu">fatcat:i7ikubw5lzaq5peabmksi6vgtu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190305033159/http://pdfs.semanticscholar.org/e563/d357c7094edadde3bd948747d6e0fce148de.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/e5/63/e563d357c7094edadde3bd948747d6e0fce148de.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/s0097539793246252"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Unambiguous Automata

Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
<span title="2008-04-11">2008</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mnlyfzbstzgpzb6iokw4xavaqa" style="color: black;">Mathematics in Computer Science</a> </i> &nbsp;
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata.  ...  The second one gives a cubic bound for the minimal length of a synchronizing pair in a complete synchronized unambiguous automaton.  ...  Local automata have very strong synchronization properties that make them very helpful in the construction of encoders or decoders used in constrained coding.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11786-007-0027-1">doi:10.1007/s11786-007-0027-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sr65mbolfbb5zapbtlqnykpxru">fatcat:sr65mbolfbb5zapbtlqnykpxru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190308113718/http://pdfs.semanticscholar.org/f249/2f927dcb3add98b018a3a31c61ef60f332fa.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/f2/49/f2492f927dcb3add98b018a3a31c61ef60f332fa.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11786-007-0027-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

LTL Model Checking of Interval Markov Chains [chapter]

Michael Benedikt, Rastislav Lenhardt, James Worrell
<span title="">2013</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 provide some analytical guarantees on the algorithm, and show how it can be combined with translation of logic to automata.  ...  can be exponentially more succinct than unambiguous automata.  ...  An advantage of working with unambiguous automata rather than deterministic automata is that there is a singly exponential translation of LTL to unambiguous automata, whereas the translation of LTL to  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-36742-7_3">doi:10.1007/978-3-642-36742-7_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l3mhblxf3nfgrc7tssc2idw6eu">fatcat:l3mhblxf3nfgrc7tssc2idw6eu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810235419/http://www.cs.ox.ac.uk/people/james.worrell/final50.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/d6/2ed67c458ba728c4a159466bb16fe67a46ab0bc8.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-36742-7_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the bound of the synchronization delay of a local automaton

Marie-Pierre Béal, Jean Senellart
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
It has been conjectured by Kim et al. (1991) that, for deterministic local automata, it is O(N") on a twoletter alphabet and no less than O(N2) in the general case.  ...  They are heavily used to construct transducers and coding schemes adapted to constrained channels.  ...  A local strongly connected automaton is unambiguous. Proposition 2. Let d be an N-state local automaton which is unambiguous or has a strongly connected graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)80011-x">doi:10.1016/s0304-3975(98)80011-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c24wqk4hdncejkhpb7tsmxlt3i">fatcat:c24wqk4hdncejkhpb7tsmxlt3i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416194227/https://core.ac.uk/download/pdf/82192673.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/fd/22/fd2254273a461d1059adc2e878e730d23b0b3ebc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(98)80011-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series

Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud, Emanuela Merelli, Artur Czumaj, Anuj Dawar
<span title="2020-06-29">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pf6v2q6ji5h7birkbrtpdc2uhy" style="color: black;">International Colloquium on Automata, Languages and Programming</a> </i> &nbsp;
We first prove a strong version of a conjecture by Castiglione and Massazza: weakly-unambiguous Parikh automata are equivalent to unambiguous two-way reversal bounded counter machines, and their multivariate  ...  Finally, we prove an effective decidability result for the inclusion problem for weakly-unambiguous Parikh automata, and provide an upper-bound on its complexity.  ...  Weakly-unambiguous Parikh automata In this section, we introduce weakly-unambiguous Parikh automata and show that their multivariate generating series are holonomic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2020.114">doi:10.4230/lipics.icalp.2020.114</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icalp/BostanCKN20.html">dblp:conf/icalp/BostanCKN20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y7zny23myrggtdhvkdv5smbutu">fatcat:y7zny23myrggtdhvkdv5smbutu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201211210926/https://drops.dagstuhl.de/opus/volltexte/2020/12521/pdf/LIPIcs-ICALP-2020-114.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/de/d9/ded99b27b7cf1e2b34f209d7be294d3b64451fc1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.icalp.2020.114"> <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>

The Containment Problem for Unambiguous Register Automata

Antoine Mottet, Karin Quaas, Michael Wagner
<span title="2019-03-12">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/npfxqbtrtjcmndol3ijtu4shem" style="color: black;">Symposium on Theoretical Aspects of Computer Science</a> </i> &nbsp;
ACM Subject Classification Theory of computation → Automata over infinite objects  ...  , where B is an unambiguous register automaton and A is an arbitrary register automaton.  ...  Finding lower bounds for unambiguous automata is a hard problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2019.53">doi:10.4230/lipics.stacs.2019.53</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stacs/MottetQ19.html">dblp:conf/stacs/MottetQ19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/byadw5qrsrhs3hvixfvrh6ceee">fatcat:byadw5qrsrhs3hvixfvrh6ceee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200225025051/https://drops.dagstuhl.de/opus/volltexte/2019/10292/pdf/LIPIcs-STACS-2019-53.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/39/f9/39f9da49980ce5e64b2b5cf02d852cca4d02b55b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.stacs.2019.53"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Constraining Linear-chain CRFs to Regular Languages [article]

Sean Papay, Roman Klinger, Sebastian Padó
<span title="2022-03-02">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We prove that constrained training is never worse than constrained decoding, and show empirically that it can be substantially better in practice.  ...  The resulting regular-constrained CRF (RegCCRF) has the same formal properties as a standard CRF, but assigns zero probability to all label sequences not in ℒ.  ...  Finite-state automata. All automata are taken to be nondeterministic finite-state automata (NFAs) without epsilon transitions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.07306v5">arXiv:2106.07306v5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qbt3qjeuajc5pdtgkwssm2hghi">fatcat:qbt3qjeuajc5pdtgkwssm2hghi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211019165541/https://arxiv.org/pdf/2106.07306v4.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ff/f0/fff04df922f755bbbaa7744fdc6ffc4caeb3ce9c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.07306v5" 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 Containment Problem for Unambiguous Register Automata [article]

Antoine Mottet, Karin Quaas
<span title="2019-01-20">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
, where B is an unambiguous register automaton and A is an arbitrary register automaton.  ...  Finding lower bounds for unambiguous automata is a hard problem.  ...  Colcombet [3, 2] considers unambiguous register automata with guessing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.08985v2">arXiv:1809.08985v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h6vtrjj5wnbk7cbycmqd5j7744">fatcat:h6vtrjj5wnbk7cbycmqd5j7744</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905233358/https://arxiv.org/pdf/1809.08985v2.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/9f/da/9fda5f91854f3dff883ceb4be59d6654a85f08d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1809.08985v2" 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>

Generating Functions of Timed Languages [chapter]

Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin
<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 provide procedures for closed-form computation of generating functions for some classes of timed automata and regular expressions. ⋆ The support of Agence Nationale de la Recherche under the project  ...  -BS02-004) is gratefully acknowledged. ⋆⋆ A part of the work of this author was done during his stay at the Institute of Mathematical Sciences (National University of Singapore) within its Programme "Automata  ...  Generating functions behave in a natural way with respect to simple operations on timed languages (disjoint union, unambiguous concatenation, unambiguous star).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32589-2_14">doi:10.1007/978-3-642-32589-2_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/buag4wf2crfqpgzjjqz7kijkr4">fatcat:buag4wf2crfqpgzjjqz7kijkr4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415061050/https://core.ac.uk/download/pdf/47103304.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/fe/e2fed10e0e5b8beaee90a5e069282c452df2985b.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-32589-2_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,198 results