Semigroups of automata with a two-letter output alphabet

1989 ◽  
Vol 46 (6) ◽  
pp. 2253-2257
Author(s):  
E. L. Stolov
Keyword(s):  
Output Alphabet

scholarly journals On the Balancedness of Tree-to-Word Transducers

2021 ◽  
pp. 1-23
Author(s):  
Raphaela Löbel ◽  
Michael Luttenberger ◽  
Helmut Seidl
Keyword(s):  
Polynomial Time ◽  
Context Free Language ◽  
Non Linear ◽  
Tree Transducers ◽  
Context Free ◽  
Free Language ◽  
Output Alphabet

A language over an alphabet [Formula: see text] of opening ([Formula: see text]) and closing ([Formula: see text]) brackets, is balanced if it is a subset of the Dyck language [Formula: see text] over [Formula: see text], and it is well-formed if all words are prefixes of words in [Formula: see text]. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-TW of non-linear tree transducers with output alphabet [Formula: see text] whether or not the output language is balanced.

scholarly journals On the Expressive Power of Some Extensions of Linear Temporal Logic

2018 ◽  
Vol 25 (5) ◽  
pp. 506-524
Author(s):  
Anton Gnatenko ◽  
Vladimir Zakharov
Keyword(s):  
Temporal Logic ◽  
Reactive Systems ◽  
Expressive Power ◽  
Linear Temporal Logic ◽  
Reactive System ◽  
Formal Specifications ◽  
Control Signals ◽  
Finite State ◽  
Finite State Transducer ◽  
Output Alphabet

One of the most simple models of computation which is suitable for representation of reactive systems behaviour is a finite state transducer which operates over an input alphabet of control signals and an output alphabet of basic actions. The behaviour of such a reactive system displays itself in the correspondence between flows of control signals and compositions of basic actions performed by the system. We believe that the behaviour of this kind requires more suitable and expressive means for formal specifications than the conventionalLT L. In this paper, we define some new (as far as we know) extensionLP-LT Lof Linear Temporal Logic specifically intended for describing the properties of transducers computations. In this extension the temporal operators are parameterized by sets of words (languages) which represent distinguished flows of control signals that impact on a reactive system. Basic predicates in our variant of the temporal logic are also languages in the alphabet of basic actions of a transducer; they represent the expected response of the transducer to the specified environmental influences. In our earlier papers, we considered a model checking problem forLP-LT LandLP-CT Land showed that this problem has effective solutions. The aim of this paper is to estimate the expressive power ofLP-LT Lby comparing it with some well known logics widely used in the computer science for specification of reactive systems behaviour. We discovered that a restricted variant LP-1-LT Lof our logic is more expressive thanLTLand another restricted variantLP-n-LT Lhas the same expressive power as monadic second order logic S1S.

scholarly journals On Generalizations and Improvements to the Shannon-Fano Code

2017 ◽  
Vol 10 (1) ◽  
pp. 1
Author(s):  
D Várkonyi ◽  
P Hudoba
Keyword(s):  
Data Compression ◽  
Huffman Code ◽  
Test Results ◽  
Average Performance ◽  
Lossless Data Compression ◽  
Output Alphabet

This paper examines the possibility of generalizing the Shannon-Fano code for cases where the output alphabet has more then 2 (n) symbols. This generalization is well-known for the famous Huffman code. Furthermore, we will be looking at possible improvements to the algorithm, as well as other entropy based lossless data compression techniques, based on the same ideas as the Shannon-Fano code. All algorithms discussed in the paper were implemented by us in C++, and we will be illustrating our hypotheses with test results, made on an average performance PC.

Sign in / Sign up

Export Citation Format

Share Document