Questions tagged [transducers]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1 vote
0 answers
34 views

Finite-state transducer to accept $i$'th word of DFA

If I have a DFA $D$ that accepts some regular language $L$, is it possible to construct some finite-state transducer $T$ that takes in an index $i$, and puts out the $i$'th word in $L$, ordered ...
user avatar
  • 206
1 vote
1 answer
40 views

Find a transducer that maps a given deterministic process to another

Let $S$ denote a deterministic process which generates a certain string, described through a Hidden Markov Model. More specifically, for a process with alphabet $\mathcal{A}$ and $n$ hidden states, ...
user avatar
  • 111
1 vote
0 answers
34 views

How to prove existance and construct finite-state transducer between two different FSM?

For example I have 2 simple FSM. I will use regular expression for clarity. ...
user avatar
  • 287
0 votes
0 answers
66 views

Finite state transducer that multiplies numbers

How is possible to construct a finite state transducer that multiplies a number by 5? We can assume that numbers are supplied in binary notation, from least significant bits to most significant.
user avatar
  • 99
0 votes
1 answer
30 views

Why are sensors transducers when analogue-to-digital-converters (ADC) do the actual conversion?

As sensors only sense continuous quantities whereas an ADC is a device which actually converts one form of input to another.
user avatar
2 votes
0 answers
34 views

Regular string relations - proof of correctness

Let $T \subseteq \Sigma^* \times \Sigma^*$ be a regular (rational) relation. We define the obligatory rewrite relation over $T$ as follows: $$ R^{obl}(T) := N(T) \cdot (T \cdot N(T))^* $$ $$ N(T) := ...
user avatar
0 votes
0 answers
23 views

About quasi-linear finite automata

Let M a finite state transducer define as : $M=<X,Y,S,\delta,\lambda>$ What we mean by quasi-linear finite automata?
user avatar
0 votes
0 answers
62 views

About number of NFSTs

Can we proof the number of NFSTs with $n$ states : $n.2^{mpn}.2^{n}$ where $p$ is the cardinal of input alphabet and $m$ the cardinal of output alphabet.
user avatar
0 votes
0 answers
26 views

What is the optimal combination of transducers with limited capabilities to a more powerful transducer?

Assume we have a number of transducers with limited information processing capabilities. Are there theoretical results (proofs) on how these transducers can be combined by some sort of communication ...
user avatar
1 vote
0 answers
33 views

Chomsky hierarchy for finite state transducers

In this question in the first answer someone mentions a "special transduction hierarchy". I cannot find anywhere anything about it. Could someone point me to resources on this topic?
user avatar
  • 143
2 votes
1 answer
117 views

Is it possible to constract Moore or Mealy machine with a different size of input and output?

Is it possible to constract Moore or Mealy machine to take input tape: 0011 and output: 00001111 (or vice versa). In other words, input and output have different size. I want to construct FSMs to ...
user avatar
  • 287
4 votes
1 answer
133 views

Is the power of a natural number logspace-computable?

Given a constant $n\in\mathbb{N}_+$, is the simple power function $$ λ\,x\in\mathbb{N}_+.\,x^n $$ logspace computable by a logspace transducer (which has a read-only input tape, a working read-write ...
user avatar
2 votes
0 answers
117 views

Which transducer models replacement in regex?

I am looking for the right transducer which allows to translate a sequence of literals into a sequence of same literals (or a subset of them) in arbitrary order. For example: ABC => CAB, which, with ...
user avatar
0 votes
1 answer
102 views

Show that the regular language is contained in another

Let L1 and L2 be two non empty regular language. How can I show that the following expression is correct with an example ? $\bigotimes$ denote the transducer cross product. $L_1^+ \bigotimes L_2^+$ ...
user avatar
  • 155
3 votes
1 answer
1k views

Are finite state transducers and Mealy machines the same machines?

There are several versions of the definitions of the FST and the Mealy machine. Some of the definitions are almost same. Some have a little differences. But it seems that they both are a kind of DFA ...
user avatar
  • 589
0 votes
1 answer
442 views

Is the output of a Mealy/Moore automaton a regular language?

How can I prove that the output sequence of Mealy Moore Machine is a Regular Language ? And what if transition outputs more than one character ? How can we prove for this case that the language in (1) ...
user avatar
1 vote
0 answers
279 views

Regexp substitution and finite-state transducers

Many programming languages support a "regular expression substitution" operation: if r is a regular expression and s, ...
user avatar
  • 143k
-1 votes
1 answer
244 views

Can a finite state transducer emit $\epsilon$?

Can a deterministic finite state transducer output ϵ (epsilon) ? A Deterministic Finite-state Transducer (DFT) is a device much like a DFA, except that its purpose is not to accept strings or ...
user avatar
1 vote
0 answers
27 views

almost realtime push down relation vs realtime pushdown relation?

Almost realtime pushdown relation pop a symbol for each empty step. Realtime pushdown relation does not perform any empty step. What do they mean by empty step?
user avatar
3 votes
0 answers
59 views

How to apply insights from the theory of codes to alternating codes?

The book Theory of codes by J. Berstel and D. Perrin from 1985 studies variable-length codes. The focus is less on error-correction and compression, but more on algebraic properties, synchronization ...
user avatar
6 votes
1 answer
109 views

Can Tree Transducers Self-Interpret?

Is it possible for MSO graph/tree transducers to reflect themselves, namely to create an interpreter of tree/graph transducers using tree/graph transducers? If yes, I'll be happy for some design ...
user avatar
1 vote
2 answers
243 views

What is the expressive power of finite-state transducers and pushdown transducers?

One would assume that a finite state transducer can perform any translation such that the resulting string is from a regular grammar. Similarly, that a pushdown transducer can generate strings from ...
user avatar
  • 135
-3 votes
1 answer
139 views

State machine that multiplies a binary number with a constant

I'm trying to create a FSM that multiplies a bitstream with a constant value (e.g 3). I don't have a clue how to design such a FSM. Any hints?
user avatar
  • 101
4 votes
1 answer
895 views

NL and NP compute different binary relations, so what?

Let the binary relation computed by a nondeterministic transducer be the relation between input strings and the possible output strings the transducer can produce (and accept) for the given input ...
user avatar
0 votes
1 answer
86 views

Why not just use FSTs for combining syntactic and semantic analysis?

I've just found the finite state transducer. Since the FST processes two tapes: one for input, one for output, shouldn't it be possible to use FST to "pack together" some compiler stages, such as ...
user avatar
  • 559
-1 votes
1 answer
271 views

How would a finite state transducer with no output function work?

Say I have a finite state transducer, 6 tuple FST with a set of states, input symbols, output symbols, transition function, a start state, and an output function. If I combine the output function into ...
user avatar
0 votes
1 answer
465 views

Closure properties of finite state transducers

Given $T_1, T_2\colon \Sigma^* \to \Gamma^*$ ($\Gamma$ is output alphabet), let $\Delta(T_1, T_2)$ consist of all input strings $w \in Σ^*$ where $T_1(w) \neq T_2(w)$. Prove that FSTs ...
user avatar
11 votes
3 answers
2k views

Algorithms for minimizing Moore automata

Brzozowski's algorithm can be extended to Moore automata but its time complexity is exponential in general. Is there any other algorithm for minimization of Moore automata? What are the running times ...
user avatar