commit 9f595124e4a353cecc58d580f79b9d9c519c1dcf
parent ef6eb944b15a1bb2cfef51818443fe4588497e74
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 19 Jun 2025 00:26:41 +0200
commit with codex
Diffstat:
2 files changed, 0 insertions(+), 55 deletions(-)
diff --git a/unambiguity b/unambiguity
@@ -1,39 +0,0 @@
-# Unambiguity
-
-An [automata] is [unambiguous] if every word that it accepts has at most one accepting run. In particular see [word_automaton_unambiguous]
-
-## Generalization
-
-- [k_ambiguous] [automata]
- - comparison between different types of ambiguity: [ravikumar1989relating]
-- [unambiguity_alternating]
-
-## Variants
-
-- "strongly unambiguous" automaton: an automaton that can be used both an as unambiguous automaton for the language and as an unambiguous automaton for the [complement]: defined in [colcombet2012forms]
-
-## Separation
-
-- Exponential separation between unambiguous automaton and [automata_nondeterministic]: section 3 of [leung2005descriptional] ([communication_complexity] method)
-
-pas de conversion polynomiale de 2-UFA vers [unambiguous_finite_automaton] par [goos2021lower]
-- mais on peut compter les mots acceptés par un k-UFA à k constant par
- [stearns1985equivalence]
-
-## Types
-
-- [unambiguous_star_free_language]
-
-## For [context_free_language]
-
-- [context_free_grammar_unambiguous]
-
-## For other problems
-
-- [satisfiability_unambiguous]
-
-See also: [ddnnf], [unambiguous], [determinism_language]
-
-Up: [formal_language_theory]
-
-Aliases: automaton unambiguous
diff --git a/word_automaton_unambiguous b/word_automaton_unambiguous
@@ -1,16 +0,0 @@
-# Unambiguous word automata
-
-[inclusion], [equivalence] are in P [ptime] (even NC [nc]?) whereas they are [pspace] PSPACE-c for
-[word_automaton_nondeterministic]
-
-More restricted definition: [word_automaton_self_verifying]
-
-Variant: [word_automaton_exclusive]
-
-[unambiguous_word_automaton_complementation]
-
-Up: [word_automaton], [unambiguity]
-
-See also: [word_automaton_finitely_ambiguous], [word_automaton_polynomially_ambiguous]
-
-Aliases: UFA, UFAs, unambiguous word automaton
