5 results
Search Results
2. DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS.
- Author
-
Loos, Remco, Malcher, Andreas, and Wotschke, Detlef
- Subjects
- *
PROGRAMMING languages , *COMPUTER hardware description languages , *LANGUAGE & languages , *COMPUTER science , *MACHINE theory , *KNOTS & splices - Abstract
In this paper, the descriptional complexity of extended finite splicing systems is studied. These systems are known to generate exactly the class of regular languages. Upper and lower bounds are shown relating the size of these splicing systems, defined as the total length of the rules and the initial language of the system, to the size of their equivalent minimal nondeterministic finite automata (NFA). In addition, an accepting model of extended finite splicing systems is studied. Using this variant one can obtain systems which are more than polynomially more succinct than the equivalent NFA or generating extended finite splicing system. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
3. HYBRID EXTENDED FINITE AUTOMATA.
- Author
-
BORDIHN, HENNING, HOLZER, MARKUS, and KUTRIB, MARTIN
- Subjects
- *
MACHINE theory , *FINITE element method , *SET theory , *ALPHABET -- Data processing , *PROGRAMMING languages , *COMPUTER science - Abstract
Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations. In this paper, five word operations are taken into consideration which always yield letter-equivalent results, namely reversal and shift operations. The computational power of those machines is investigated, locating the corresponding families of languages in the Chomsky hierarchy. Furthermore, different types of hybrid extended finite automata, defined by the set of operations they are allowed to apply, are compared with each other, demonstrating that there exist dependencies and independencies between the input manipulating operations. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
4. Distributed ω-Automata.
- Author
-
Krithivasan, Kamala, Sharda, K., and Varma, Sandeep V.
- Subjects
- *
MACHINE theory , *PROGRAMMING languages , *DISTRIBUTED computing , *COMPUTER science - Abstract
In this paper, we introduce the notion of distributed ω-automata. Distributed ω-automata are a group of automata working in unison to accept an ω-language. We build the theory of distributed ω-automata for finite state automata and pushdown automata in different modes of cooperation like the t-mode, *-mode, = k-mode, ≤ k-mode and ≥ k-mode along with different acceptance criteria i.e. Büchi-, Muller-, Rabin- and Streett- acceptance criteria. We then analyze the acceptance power of such automata in all the above modes of cooperation and acceptance criteria. We present proofs that distributed ω-finite state automata do not have any additional power over ω-finite state automata in any of the modes of cooperation or acceptance criteria, while distributed ω-pushdown automata can accept languages not in CFL[sub ω]. We give proofs for the equivalence of all modes of cooperation and acceptance criteria in the case of distributed ω-pushdown automata. We show that the power of distributed ω-pushdown automata is equal to that of ω-Turing Machines. We also study the deterministic version of distributed ω-pushdown automata. Deterministic ω-pushdown automata accept only languages contained in CFL[sub ω] but distributed deterministic ω-pushdown automata can accept languages not in CFL[sub ω] and have the same power as their nondeterministic counterparts. We also define distributed completely deterministic ω-pushdown automata and analyze their power. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
5. A Generic Approach to the Static Analysis of Concurrent Programs with Procedures.
- Author
-
Bouajjani, Ahmed, Esparza, Javier, and Touili, Tayssir
- Subjects
- *
COMPUTER software , *PROGRAMMING languages , *ABSTRACT thought , *MACHINE theory , *COMPUTER science - Abstract
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow problems for this model are undecidable, because the emptiness problem for the intersection of context-free languages, which is undecidable, can be reduced to them. In this paper we propose an algebraic framework for defining abstractions (upper approximations) of context-free languages. We consider two classes of abstractions: finite-chain abstractions, which are abstractions whose domains do not contain any infinite chains, and commutative abstractions corresponding to classes of languages that contain a word if and only if they contain all its permutations. We show how to compute such approximations by combining automata theoretic techniques with algorithms for solving systems of polynomial inequations in Kleene algebras. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.