Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Multiset Pushdown Automata
View through CrossRef
Multiset finite Automata, a model equivalent to regular commutative
grammars, are extended with a multiset store and the accepting power of this
extended model of computation is investigated. This type of multiset automata
come in two flavours, varying only in the ability of testing the storage for
emptiness. This paper establishes normal forms and relates the derived language
classes to each other as well as to known multiset language classes.
Title: Multiset Pushdown Automata
Description:
Multiset finite Automata, a model equivalent to regular commutative
grammars, are extended with a multiset store and the accepting power of this
extended model of computation is investigated.
This type of multiset automata
come in two flavours, varying only in the ability of testing the storage for
emptiness.
This paper establishes normal forms and relates the derived language
classes to each other as well as to known multiset language classes.
Related Results
Weighted Pushdown Systems with Indexed Weight Domains
Weighted Pushdown Systems with Indexed Weight Domains
The reachability analysis of weighted pushdown systems is a very powerful
technique in verification and analysis of recursive programs. Each transition
rule of a weighted pushdown ...
An investigation of Boolean filter and Boolean pseudofilter over a residuated lattice in multiset and anti-multiset contexts
An investigation of Boolean filter and Boolean pseudofilter over a residuated lattice in multiset and anti-multiset contexts
Abstract
In this paper, the concepts of multiset Boolean filter, multiset Boolean pseudofilter, anti-multiset Boolean filter, and anti-multiset Boolean pseudofilter ...
Local Multiset Dimension of Amalgamation Graphs
Local Multiset Dimension of Amalgamation Graphs
\textbf{Background}: One of the topics of distance in graphs is the resolving set problem. Suppose the set $W=\{s_1,s_2,…,s_k\}\subset V(G)$, the vertex representations of $\in V(G...
Local Multiset Dimension of Amalgamation Graphs
Local Multiset Dimension of Amalgamation Graphs
\textbf{Background}: One of the topics of distance in graphs is the resolving set problem. Suppose the set $W=\{s_1,s_2,…,s_k\}\subset V(G)$, the vertex representations of $\in V(G...
Simulations for Event-Clock Automata
Simulations for Event-Clock Automata
Event-clock automata (ECA) are a well-known semantic subclass of timed
automata (TA) which enjoy admirable theoretical properties, e.g.,
determinizability, and are practically usef...
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
AbstractIn this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, includ...
Permutation Groups in Automata Diagrams
Permutation Groups in Automata Diagrams
Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types o...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...