Optimal simulation of self-verifying automata by deterministic automata
type: Item
instance of: scholarly article
title: Optimal simulation of self-verifying automata by deterministic automata
zbMATH Open document ID: 1217.68132
author: Galina Jirásková
author: Giovanni Pighizzini
published in: Information and Computation
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 5932329
zbMATH Keywords: finite automata
zbMATH Keywords: nondeterminism
zbMATH Keywords: self-verifying automata
zbMATH Keywords: descriptional complexity
MaRDI profile type: Publication
full work available at URL: j.ic.2010.11.017
OpenAlex ID: W1978638999
Wikidata QID: Q57380749
cites work: Q5422234
cites work: Q5541339
cites work: Q5554980
cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
cites work: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
cites work: Nondeterministic Communication with a Limited Number of Advice Bits
cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
cites work: An upper bound for transforming self-verifying automata into deterministic ones
cites work: On cliques in graphs
cites work: Q4503150
cites work: Q4531373
cites work: Finite automata and unary languages
cites work: Complementing unary nondeterministic automata
cites work: Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
DOI: 10.1016/J.IC.2010.11.017
DBLP publication ID: journals/iandc/JiraskovaP11
description: scientific article; zbMATH DE number 5932329