A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Affine Parikh automata
2012
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. ...
Here we adopt this view and define the affine PA, that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters, that restricts the PA by forcing ...
Affine Parikh automata on Q and N In this section, we show that the expressive power of affine Parikh automata is independent from the choice of K. ...
doi:10.1051/ita/2012013
fatcat:7el7mptef5cedgdk3hnhzoeha4
Value Automata with Filters
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Models such as weighted automata and Parikh automata appear naturally as specializations. ...
We propose to study value automata with filters, a natural generalization of regular cost automata to nondeterminism. ...
Locality and incrementality being at the heart of our models, such automata do not seem to have an equivalent expression within VAF. Parikh automata and affine Parikh automata. ...
arXiv:1510.02393v1
fatcat:x66kwwt4pjhmrm6jkemkvobxxi
Regular Separability of Parikh Automata
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. ...
is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is disjoint from ...
In this paper, we present our results in terms of constrained automata, but given the similarity with Parikh automata (and in light of their equivalence), we overload the name Parikh automata for both ...
arXiv:1612.06233v1
fatcat:z3va4zfkxjc3pn6rklhbegh474
Bounded Parikh Automata
2011
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. ...
The flat DetPA involved can be made into flat DetCA because the equivalence in Theorem 1 carries over the case of flat automata. ...
Bounded Parikh automata are determinizable Parikh automata cannot be made deterministic in general. ...
doi:10.4204/eptcs.63.13
fatcat:kg4wne45yfasjgvqgawznldacy
BOUNDED PARIKH AUTOMATA
2012
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Rueß [18] . ...
The flat DetPA involved can be made into flat DetCA because the equivalence in Theorem 1 carries over the case of flat automata. ...
Bounded Parikh automata are determinizable Parikh automata cannot be made deterministic in general. ...
doi:10.1142/s0129054112400709
fatcat:7vfbpeojv5fwzjswm7ppcs4jcu
On the expressiveness of Parikh automata and related models
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
The Parikh finite word automaton (PA) was introduced and studied by Klaedtke and Ruess in 2003. ...
Here we adopt this view and define the affine PA (APA), that extends the PA by having each transition induce an affine transformation on the PA registers, and the PA on letters (LPA), that restricts the ...
Definition 4 (Affine Parikh automaton). A K-affine Parikh automaton (K-APA) of dimension Remark. It is easily seen that N-APA (resp. N-DetAPA) are a generalization of CA (resp. DetCA). ...
arXiv:1101.1547v4
fatcat:ikt27ljgxfc3homcvoe3eymtvu
UNAMBIGUOUS CONSTRAINED AUTOMATA
2013
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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. ...
Definition 4 (Affine Parikh automaton [3] ). ...
As a result of independent interest, we show that CA are equivalent to the nondeterministic variant of this model, and that a seemingly more powerful model (so-called finite-monoid affine Parikh automata ...
doi:10.1142/s0129054113400339
fatcat:m6hixrt42ra65c5ivugqrtgcui
Unambiguous Constrained Automata
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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. ...
Definition 4 (Affine Parikh automaton [3] ). ...
As a result of independent interest, we show that CA are equivalent to the nondeterministic variant of this model, and that a seemingly more powerful model (so-called finite-monoid affine Parikh automata ...
doi:10.1007/978-3-642-31653-1_22
fatcat:ke64zflzgbes5hn4jljqdhag2i
Cumulative subject index volumes 44–47
1980
Information and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
performance in twodimensional packing, 45, 1 Announcement recursion theoretic aspects of computer science, workshop, 47, 154 Asymmetric codes error-correcting, binary:Constantin-Rao construction for, 44, 187 Automata ...
A B Adult concept and extension concept, equivalent for deterministic 0L systems with two tables, 47, 107 Affine transformations and linear equivalences of Boolean functions, 45, 156 Algebras tree, of ...
context sensitive, 47, 166
Formal languages
inductive inference of, from positive data,
45, 117
Frequency data
multiple mutual information and multiple
interactions in, 46, 26
Functions
Boolean, affine ...
doi:10.1016/s0019-9958(80)90592-6
fatcat:zwdwzq5kifakzlpgfkl5hog2ra
Page 4868 of Mathematical Reviews Vol. , Issue 2004f
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
As an application, they solve the language equivalence problem for Parikh simple HDOL systems. ...
For every n > 2, we construct a system of equivalent transformations that is complete in the set of all n-tape automata.” ...
Integer Vector Addition Systems with States
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Parikh images of, for instance, finitestate automata or context-free grammars. ...
[26] for defining Parikh images of finitestate automata in existential Presburger arithmetic, we can show that a given instance of reachability (and a fortiori coverability) in Z-VASS R can be reduced ...
doi:10.1007/978-3-319-11439-2_9
fatcat:7pvckuxbvzfrvkecxg2wqrkaum
Page 7326 of Mathematical Reviews Vol. , Issue 90M
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Suppose further that L has rational Parikh image. ...
Summary: “Let (A: S) be the A-closure of a set S of nonnegative integers, where A is a finite set of affine functions, each defined on the integers. ...
The Parikh Property for Weighted Context-Free Grammars
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
If the result holds for a given weighted CFG G, we say that G satisfies the Parikh property. We prove constructively that the Parikh property holds for every weighted nonexpansive CFG. ...
Weighted finite-state automata are a generalization of the classical nondeterministic finite-state automata in which each transition carries a weight. ...
We prove that, for every WCFG G ⌈k⌉ , W ⌈k⌉ , the index of an LDF derivation sequence is always bounded by an affine function of k (Lemma 25). ...
arXiv:1810.01351v1
fatcat:brzgdd3efzdvlkvfaiz5ew4ava
Ordinal Theory for Expressiveness of Well Structured Transition Systems
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For example, if we look at Timed Automata, clocks are a strict resource: Timed Automata with k clocks are less expressive that Timed Automata with k + 1 clocks [4] . ...
In [1, 2] the expressive power of Petri Nets is proved to be strictly below that of Affine Well Nets, and Affine Well Nets are proved to be strictly less expressive than Lossy Channel Systems. ...
doi:10.1007/978-3-642-19805-2_11
fatcat:qu2chgdv5ffl7hnpqzoic7otue
Ordinal theory for expressiveness of well-structured transition systems
2013
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For example, if we look at Timed Automata, clocks are a strict resource: Timed Automata with k clocks are less expressive that Timed Automata with k + 1 clocks [4] . ...
In [1, 2] the expressive power of Petri Nets is proved to be strictly below that of Affine Well Nets, and Affine Well Nets are proved to be strictly less expressive than Lossy Channel Systems. ...
doi:10.1016/j.ic.2012.11.003
fatcat:5it6cvhkkrhwhdl5ge7splb4sq
« Previous
Showing results 1 — 15 out of 84 results