2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2021

DOI: 10.1109/lics52264.2021.9470688

|View full text |Cite

|

Sign up to set email alerts

|

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata

Elisabet Burjons

¹

,

²

,

³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Our Contributions1

Citation Types

Supporting

0

Mentioning

1

Contrasting

0

Publication Types

Select...

Other1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 20 publications

Supporting

0

Mentioning

1

Contrasting

0

Order By: Relevance

“…We have formally proved the main results of this paper (Theorems 8 and 9 and Claims 14 and 15) as well as Examples 7 and 10 in the Isabelle proof assistant [2], ensuring their correctness. We also provide pen-and-paper proofs for all of our results.…”

Section: Our Contributionsmentioning

confidence: 65%

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata

Frei²,

2020

Preprint

Self Cite

View full text Add to dashboard Cite

The question whether P = NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic finite transducer defines a binary relation associating input words with output words that are computed and accepted by the transducer. Functional transducers are those for which the relation is a function. We characterize functional nondeterministic transducers whose relations can be verified by a deterministic two-tape automaton, show how to construct such an automaton if one exists, and prove the undecidability of the criterion.

“…We have formally proved the main results of this paper (Theorems 8 and 9 and Claims 14 and 15) as well as Examples 7 and 10 in the Isabelle proof assistant [2], ensuring their correctness. We also provide pen-and-paper proofs for all of our results.…”

Section: Our Contributionsmentioning

confidence: 65%

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata

Frei²,

2020

Preprint

Self Cite

View full text Add to dashboard Cite

The question whether P = NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic finite transducer defines a binary relation associating input words with output words that are computed and accepted by the transducer. Functional transducers are those for which the relation is a function. We characterize functional nondeterministic transducers whose relations can be verified by a deterministic two-tape automaton, show how to construct such an automaton if one exists, and prove the undecidability of the criterion.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2025 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.