On the public citation graph

On the degree of ambiguity of finite automata

https://doi.org/10.1007/bfb0016289
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16078-7_74openalex-snapshot
On sparseness, ambiguity and other decision problems for acceptors and transducers
inferredcites →https://doi.org/10.1007/bf00263994openalex-snapshot
Amounts of nondeterminism in finite automata
inferredcites →https://doi.org/10.1007/bf01744569openalex-snapshot
A note on finite-valued and finitely ambiguous transducers
inferredcites →https://doi.org/10.1007/bfb0016250openalex-snapshot
The equivalence of finite valued transducers (on HDTOL languages) is decidable
inferredcites →https://doi.org/10.1016/0022-0000(82)90051-4openalex-snapshot
Limitedness theorem on finite automata with distance functions
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(88)90012-6openalex-snapshot
On the finite-valuedness problem for sequential machines
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1137/0214044openalex-snapshot
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
inferredcites →https://doi.org/10.1145/321466.321473openalex-snapshot
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11611257_36openalex-snapshot
On Separating Constant from Polynomial Ambiguity of Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_40openalex-snapshot
Relating the degree of ambiguity of finite automata to the succinctness of their representation
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_114openalex-snapshot
New techniques for proving the decidability of equivalence problems
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_98openalex-snapshot
On the lengths of values in a finite transducer
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_38openalex-snapshot
On the finite degree of ambiguity of finite tree automata
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_54openalex-snapshot
Equivalence of finite-valued bottom-up finite state tree transducers is decidable
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_8openalex-snapshot
General Algorithms for Testing the Ambiguity of Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_30openalex-snapshot
Bounded Delay and Concurrency for Earliest Query Answering
inferred← citeshttps://doi.org/10.1007/bf00263578openalex-snapshot
On the finite degree of ambiguity of finite tree automata
inferred← citeshttps://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
inferred← citeshttps://doi.org/10.1007/bfb0017179openalex-snapshot
A decomposition theorem for finite-valued transducers and an application to the equivalence problem
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90189-oopenalex-snapshot
New techniques for proving the decidability of equivalence problems
inferred← citeshttps://doi.org/10.1016/j.ic.2010.08.003openalex-snapshot
Queries on Xml streams with bounded delay and concurrency
inferred← citeshttps://doi.org/10.1051/ita/1991250100191openalex-snapshot
On finitely generated monoids of matrices with entries in $\mathbb {N}$
inferred← citeshttps://doi.org/10.1137/0216018openalex-snapshot
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
inferred← citeshttps://doi.org/10.1137/0218083openalex-snapshot
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
inferred← citeshttps://doi.org/10.1142/s0129054111008477openalex-snapshot
GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS
inferred← citeshttps://doi.org/10.25596/jalc-2006-169openalex-snapshot
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.