DeepAI
Log In Sign Up

One-way resynchronizability of word transducers

01/20/2021
by   Sougata Bose, et al.
0

The origin semantics for transducers was proposed in 2014, and led to various characterizations and decidability results that are in contrast with the classical semantics. In this paper we add a further decidability result for characterizing transducers that are close to one-way transducers in the origin semantics. We show that it is decidable whether a non-deterministic two-way word transducer can be resynchronized by a bounded, regular resynchronizer into an origin-equivalent one-way transducer. The result is in contrast with the usual semantics, where it is undecidable to know if a non-deterministic two-way transducer is equivalent to some one-way transducer.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/01/2012

The Equational Approach to CF2 Semantics

We introduce a family of new equational semantics for argumentation netw...
02/14/2022

Coalgebraic Semantics for Nominal Automata

This paper provides a coalgebraic approach to the language semantics of ...
04/26/2013

Non Deterministic Logic Programs

Non deterministic applications arise in many domains, including, stochas...
09/27/2019

Towards Coq-verified Esterel Semantics and Compiling

This paper focuses on semantics of the Esterel synchronous programming l...
06/30/2020

Binary intersection formalized

We provide a reformulation and a formalization of the classical result b...
04/14/2022

Algebraizability of the Logic of Quasi-N4-Lattices

The class of quasi-N4-lattices (QN4-lattices) was introduced as a common...
11/23/2022

Run-Based Semantics for RPQs

The formalism of RPQs (regular path queries) is an important building bl...