Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words. | Zendy

AI Assistant Blog Pricing

Open Access

Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words.

Author(s) -

François Gonze,

Raphaël M. Jungers

Publication year - 2019

Publication title -

j. autom. lang. comb.

Language(s) - English

DOI - 10.25596/jalc-2019-321

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Our institutional solutions Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.