14 citations · 15 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.FL2025
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
Bruno Guillon, Luca Prigioniero, Javad Taheri
We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a…
cs.FL2025
Nondeterminism makes unary 1-limited automata concise
Bruno Guillon, Luca Prigioniero, Javad Taheri
We investigate the descriptional complexity of different variants of 1-limited automata (1-las), an extension of two-way finite automata (2nfas) characterizing regular languages. I…