A bounded-crossing transducer is defined and it is shown that the family of languages generated is equal to the family of languages generated by two-way deterministic finite-state transducers
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
A bounded-crossing transducer is defined and it is shown that the family of languages generated is e...
An iterated uniform finite-state transducer (IUFST) runs the samelength-preserving transduction, sta...
An iterated uniform finite-state transducer executes the same length-preserving transduction in iter...
A deterministic iterated uniform finite-state transducer (for short, iufst) operates the same length...
Absolutely parallel grammars are defined, and it, is shown that the family of languages generated is...
The question whether P equals NP revolves around the discrepancy between active production and mere ...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Every nondeterministic finite-state automaton is equivalent to a deterministic finite-state automato...
We introduce the deterministic computational model of an iterated uniform finite-state transducer (I...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
A bounded-crossing transducer is defined and it is shown that the family of languages generated is e...
An iterated uniform finite-state transducer (IUFST) runs the samelength-preserving transduction, sta...
An iterated uniform finite-state transducer executes the same length-preserving transduction in iter...
A deterministic iterated uniform finite-state transducer (for short, iufst) operates the same length...
Absolutely parallel grammars are defined, and it, is shown that the family of languages generated is...
The question whether P equals NP revolves around the discrepancy between active production and mere ...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Every nondeterministic finite-state automaton is equivalent to a deterministic finite-state automato...
We introduce the deterministic computational model of an iterated uniform finite-state transducer (I...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
International audienceWe introduce the deterministic computational model of an iterated uniform fini...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
International audienceAny two-way finite state automaton is equivalent to some one-way finite state ...
DOI
Add to ORKG