39,633 research outputs found
One-Way Reversible and Quantum Finite Automata with Advice
We examine the characteristic features of reversible and quantum computations
in the presence of supplementary external information, known as advice. In
particular, we present a simple, algebraic characterization of languages
recognized by one-way reversible finite automata augmented with deterministic
advice. With a further elaborate argument, we prove a similar but slightly
weaker result for bounded-error one-way quantum finite automata with advice.
Immediate applications of those properties lead to containments and separations
among various language families when they are assisted by appropriately chosen
advice. We further demonstrate the power and limitation of randomized advice
and quantum advice when they are given to one-way quantum finite automata.Comment: A4, 10pt, 1 figure, 31 pages. This is a complete version of an
extended abstract appeared in the Proceedings of the 6th International
Conference on Language and Automata Theory and Applications (LATA 2012),
March 5-9, 2012, A Coruna, Spain, Lecture Notes in Computer Science,
Springer-Verlag, Vol.7183, pp.526-537, 201
Ontology View on Automata Theory
The summary of automata theory ontology is presented in the paper. It is based on the following
dependences: a type of an automaton – the language accepted by the automaton – applications. The given
ontology does not claim to be exhaustive as automata theory is very extensive and it is a complicated problem to
survey all its aspects within one article. Only the main properties of automata and their applications are
considered
A Bibliography on Fuzzy Automata, Grammars and Lanuages
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics and natural language processing
Automatic presentations for semigroups
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We give a complete list of FA-presentable one-relation semigroups and compare the classes of FA-presentable semigroups and automatic semigroups. (C) 2009 Elsevier Inc. All rights reserved.PostprintPeer reviewe
To Some Structural Properties Of ∞-languages
Properties of catenation of sequences of finite (words) and infinite (  lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices. Finite automata accept structures containing only words, automata accept only words. Structures containing both words and words (∞ - words) are mostly generated by various types of ∞ - automata(∞- machines). The aim of the paper is to investigate algebraic properties of operations on ∞ - words generated by IGk –automata, where k is to model the depth of memory. It has importance in many applications (shift registers, discrete systems with memory,…). It is shown that resulting algebraic structures are of „pure“ groupoid or partial groupoid type
Regular Expressions in a CS Formal Languages Course
Regular expressions in an Automata Theory and Formal Languages course are
mostly treated as a theoretical topic. That is, to some degree their
mathematical properties and their role to describe languages is discussed. This
approach fails to capture the interest of most Computer Science students. It is
a missed opportunity to engage Computer Science students that are far more
motivated by practical applications of theory. To this end, regular expressions
may be discussed as the description of an algorithm to generate words in a
language that is easily programmed. This article describes a programming-based
methodology to introduce students to regular expressions in an Automata Theory
and Formal Languages course. The language of instruction is FSM in which there
is a regular expression type. Thus, facilitating the study of regular
expressions and of algorithms based on regular expressions.Comment: In Proceedings TFPIE 2023, arXiv:2308.0611
- …