An Infinite Proper Subset of Regular Languages as a State Change Based Coupling of Finite Automata

Date

2015-10-23

Author

Çevik, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

113
views

0
downloads

We introduce an infinite proper subset of regular languages (RL), so called the state change couple of finite automata (FA). The execution time state change behavior of FA is shown to be modelled as state automata (SA). For our purpose, we define a unary operator whose domain is FA and range is SA. The new language class obtained by applying the operator on FA is called state change languages (SCL). We show that SCL is closed under union, but not under complementation, homomorphism and inverse homomorphism. We also investigate the properties of SA with empty string transitions. The work given here can be considered as a basis for analyzing the language class properties of the runtime attributes of basic computational models.

Subject Keywords

Run-time attributes, Run-time attributes, State change languages, Regular languages, Finite automata

URI

https://hdl.handle.net/11511/53197

Conference Name

World Congress on Engineering and Computer Science

Collections

Department of Aerospace Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Joint densities of hitting times for finite state Markov processes Bielecki, Tomasz R.; Jeanblanc, Monique; Sezer, Ali Devin (2018-01-01) For a finite state Markov process X and a finite collection {Gamma<INF>k</INF>, k is an element of K} of subsets of its state space, let tau<INF>k</INF> be the first time the process visits the set Gamma<INF>k</INF>. In general, X may enter some of the Gamma<INF>k</INF> at the same time and therefore the vector tau := (tau<INF>k</INF>, k is an element of K) may put nonzero mass over lower dimensional regions of R<INF>+</INF> <SUP>vertical bar K vertical bar</SUP>;these regions are of the form R<INF>s</INF> ...
Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods BOZTAŞ, Serdar; Özbudak, Ferruh; TEKİN, Eda (Springer Science and Business Media LLC, 2018-05-01) We extend the parameters and generalize existing constructions of perfect autocorrelation sequences over complex alphabets. In particular, we address the PSK+ constellation (Boztas and Udaya 2010) and present an extended number theoretic criterion which is sufficient for the existence of the new sequences with perfect autocorrelation. These sequences are shown to exist for nonprime alphabets and more general lengths in comparison to existing designs. The new perfect autocorrelation sequences provide novel a...
A Fully Implicit Finite Volume Lattice Boltzmann Method for Turbulent Flow Cevik, Fatih; Albayrak, Kahraman (2017-08-01) Almost all schemes existed in the literature to solve the Lattice Boltzmann Equation like stream & collide, finite difference, finite element, finite volume schemes are explicit. However, it is known fact that implicit methods utilizes better stability and faster convergence compared to the explicit methods. In this paper, a method named herein as Implicit Finite Volume Lattice BoltzmannMethod (IFVLBM) for incompressible laminar and turbulent flows is proposed and it is applied to some 2D benchmark test cas...
Restricted Modules and Conjectures on Modules of Constant Jordan Type Öztürk, Semra (Springer, 2014-01-01) We introduce the class of restricted k[A]-modules and p t-Jordan types for a finite abelian p-group A of exponent at least p t and a field k of characteristic p. For these modules, we generalize several theorems by Benson, verify a generalization of conjectures stated by Suslin and Rickard giving constraints on Jordan types for modules of constant Jordan type when t is 1. We state conjectures giving constraints on p t-Jordan types and show that many p t-Jordan types are realizable.
A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions Uyanik, K.; Turgut, Sadi (Springer Science and Business Media LLC, 2013-11-01) In two recent papers, a sure-success version of the Grover iteration has been applied to solve the weight decision problem of a Boolean function and it is shown that it is quadratically faster than any classical algorithm (Braunstein et al. in J Phys A Math Theor 40:8441, 2007; Choi and Braunstein in Quantum Inf Process 10:177, 2011). In this paper, a new approach is proposed to generalize the Grover's iteration so that it becomes exact and its application to the same problem is studied. The regime where a ...

Citation Formats

A. Çevik, “An Infinite Proper Subset of Regular Languages as a State Change Based Coupling of Finite Automata,” presented at the World Congress on Engineering and Computer Science, San Francisco, CA, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53197.