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
Hierarchy Among Automata on Linear Orderings
[chapter]
2002
Foundations of Information Technology in the Era of Network and Mobile Computing
Preserved Fulltext
In a preceding paper, automata and rational expressions have been introduced for words indexed by linear orderings, together with a Kleenelike theorem. ...
We here pursue this work by proposing a hierarchy among the rational sets. Each class of the hierarchy is defined by a subset of the rational operations that can be used. ...
Acknowledgments We would like to thank the referees for their numerous valuable comments on an earlier version of this article. ...
doi:10.1007/978-0-387-35608-2_10
dblp:conf/ifipTCS/BruyereC02
fatcat:wft5adyctbfcpbtgb6svtjvhmq
Hierarchy Among Automata on Linear Orderings
2005
Theory of Computing Systems
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.
In a preceding paper, automata and rational expressions have been introduced for words indexed by linear orderings, together with a Kleenelike theorem. ...
We here pursue this work by proposing a hierarchy among the rational sets. Each class of the hierarchy is defined by a subset of the rational operations that can be used. ...
Acknowledgments We would like to thank the referees for their numerous valuable comments on an earlier version of this article. ...
doi:10.1007/s00224-005-1129-2
fatcat:uem6fmwfqjf25ezp2gfpnfo56a
Preface of STACS 2012 Special Issue
2014
Theory of Computing Systems
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.
These extended abstracts were among the top papers of those that were chosen for presentation at STACS 2012 in a highly competitive peer-review process (after which only 54 papers out of 274 submission ...
Christopher Broadbent, in his article On First-Order Logic and CPDA Graphs, studies higher-order pushdown automata. ...
One is that infinite fields of characteristic 0 have no injective ω-automatic presentations and one is that no field of characteristic 0 with definable linear order has an omega-automatic presentation. ...
doi:10.1007/s00224-013-9530-8
fatcat:735tiimi7jax7nxaupttepgxlu
Page 4266 of Mathematical Reviews Vol. , Issue 83j
[page]
1983
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.
The next three sections deal with the hierarchy theorems (one for space and one for time), relations among complexity measures and translational lemmas in connection with nondeterministic hierarchies. ...
The next chapter deals with the Chomsky hierarchy presenting the equivalences between regular grammars and finite automata, between type 0 grammars and Turing machines as well as between linear bounded ...
Fair Equivalence Relations
[chapter]
2000
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 2011; you can also visit the original URL.
The file type is application/pdf.
This hierarchy lies between the hierarchies of word and tree automata, and it collapses at Rabin conditions of index one, and Streett conditions of index two. § bisimulation [GL94], game-bisimulation [ ...
We show that in the branching paradigm the expressiveness hierarchy depends on the types of fair bisimulation one chooses to use. ...
We showed that while the hierarchy in the context of trace equivalence coincides with the one of nondeterministic word automata, the hierarchy in the context of bisimulation depends on the exact definition ...
doi:10.1007/3-540-44450-5_12
fatcat:dabexamcufepljiawgjdbs6psm
Fair Equivalence Relations
[chapter]
2003
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 2011; you can also visit the original URL.
The file type is application/pdf.
This hierarchy lies between the hierarchies of word and tree automata, and it collapses at Rabin conditions of index one, and Streett conditions of index two. § bisimulation [GL94], game-bisimulation [ ...
We show that in the branching paradigm the expressiveness hierarchy depends on the types of fair bisimulation one chooses to use. ...
We showed that while the hierarchy in the context of trace equivalence coincides with the one of nondeterministic word automata, the hierarchy in the context of bisimulation depends on the exact definition ...
doi:10.1007/978-3-540-39910-0_30
fatcat:6c7kpqyb2vbhlmpbm43jbvbf5i
Preface
2017
Natural Computing
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 2018; you can also visit the original URL.
The file type is application/pdf.
But if the grid is an infinite torsion group then the hierarchy based on the number of finite automata is infinite. ...
The paper also proves an infinite hierarchy of languages based on the last time instance when a cell may disappear. ...
doi:10.1007/s11047-017-9615-4
fatcat:32c2ksyhtjcn7pcnsc25aptpaa
Page 6031 of Mathematical Reviews Vol. , Issue 88k
[page]
1988
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.
Order 3 (1986), no. 2, 123-134.
Summary: “Various problems concerning greedy and super greedy linear extensions are shown to be NP-complete. ...
., is complete in one of these classes. Among the optimum problems classified in this way are traveling salesman, MAX SAT ASG, clique, independent set, and others. ...
Page 1044 of Mathematical Reviews Vol. , Issue 98B
[page]
1998
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.
Equation (2), together with the aux- iliary linear problems of the hierarchy, enables one to factor the independent x- and /,-variables in equation (1). ...
It is however necessary to impose an extra constraint on the KP-evolution in order to implement the reduction on the bilinear forms themselves. ...
Some Subclasses of Linear Languages based on Nondeterministic Linear 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 2020; you can also visit the original URL.
The file type is application/pdf.
Another, contribution is the generation of an infinite hierarchy of formal languages, going from the class of languages accepted by deterministic linear automata and achieved, in the limit, the class of ...
The main contribution of this paper is to introduce the deterministic linear automata and even linear automata, i.e. the natural restriction of nondeterministic linear automata for the deterministic and ...
In this paper we also determine an infinite hierarchy of classes of formal languages which are among the class of languages accepted by dla's and the class of linear languages. ...
arXiv:1611.10276v1
fatcat:q5wfpp3hfncgtbbabqq7pj55sy
CoInDiVinE: Parallel Distributed Model Checker for Component-Based Systems
2011
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1111.0373v1 fatcat:khsxgaw66zaypojlxpjot6pqoe
CoInDiVinE is a tool for parallel distributed model checking of interactions among components in hierarchical component-based systems. ...
The tool extends the DiVinE framework with a new input language (component-interaction automata) and a property specification logic (CI-LTL). ...
is allowed in all the composite automata on the path. ...
doi:10.4204/eptcs.72.7
fatcat:2ddhvchybzb45jhix2pq43mnba
The design and analysis of efficient learning algorithms
1994
Discrete Applied Mathematics
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.
Linearity?. Reachability of bilinear systems, ...
Linear systems and canonical realizations. The ho realization algorithm. Partial realizations. Approximate modeling and inexact data. The state-space X. The cognitive theorem. Memory and behavior. ...
Ordering the cosmos. Models and Theories. Paradigms, revolutions and normal science. Explanations vs. descriptions. "Good" models and "bad". Validation and falsification. Competition among models. ...
doi:10.1016/0166-218x(94)90159-7
fatcat:2bmebkuqn5as3gt64x6bjm4xb4
Page 3362 of Mathematical Reviews Vol. , Issue 84h
[page]
1984
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.
Among other things, it is shown that whether two rational machines generate the same graph series is indecidable.”
Finkel’ shtein, M. Ya.
Decomposition of linear automata. ...
Codability on the set of classes of environments with the same computational power provides a partial ordering, which will be considered in this paper. ...
Page 3774 of Mathematical Reviews Vol. , Issue 2003e
[page]
2003
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.
(RS-SART; Saratov)
On an optimal synchronizing experiment with linear automata. (Russian. Russian summary)
Izv. Akad. Nauk Teor. Sist. Upr. 2002, no. 3, 64-70. ...
In order to obtain solutions to this problem, a hierarchy of products has been introduced by Gécseg, where the products are called a;-products for i =0,1,... ...
Reality rules: 2 picturing the world in mathematics. The frontier
1994
Discrete Applied Mathematics
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.
Linearity?. Reachability of bilinear systems, ...
Linear systems and canonical realizations. The ho realization algorithm. Partial realizations. Approximate modeling and inexact data. The state-space X. The cognitive theorem. Memory and behavior. ...
Ordering the cosmos. Models and Theories. Paradigms, revolutions and normal science. Explanations vs. descriptions. "Good" models and "bad". Validation and falsification. Competition among models. ...
doi:10.1016/0166-218x(94)90158-9
fatcat:aexajvcevvdrrhrtm36rq3dqu4
« Previous
Showing results 1 — 15 out of 7,267 results