On finite automata with limited nondeterminism (extended abstract)

DOI10.1007/3-540-55808-X_34zbMath1493.68194OpenAlexW128863358MaRDI QIDQ5096848

Hing-Man Leung

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_34

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Exponential upper and lower bounds for the order of a regular language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limitedness theorem on finite automata with distance functions: An algebraic proof
• Improved limitedness theorems on finite automata with distance functions
• On measuring nondeterminism in regular languages
• Limitedness theorem on finite automata with distance functions
• On the topological structure of a finitely generated semigroup of matrices
• Amounts of nondeterminism in finite automata
• On the relation between ambiguity and nondeterminism in finite automata

This page was built for publication: On finite automata with limited nondeterminism (extended abstract)