On the public citation graph
Distance automata having large finite distance or finite ambiguity
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-55808-x_34openalex-snapshot
On finite automata with limited nondeterminism (extended abstract)
inferredcites →https://doi.org/10.1007/bf00263994openalex-snapshot
Amounts of nondeterminism in finite automata
inferredcites →https://doi.org/10.1007/bfb0017135openalex-snapshot
Recognizable sets with multiplicities in the tropical semiring
inferredcites →https://doi.org/10.1007/s002360050133openalex-snapshot
On finite automata with limited nondeterminism
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/0022-0000(83)90031-4openalex-snapshot
Representation theorems on regular languages
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/0304-3975(79)90057-4openalex-snapshot
A decision procedure for the order of regular events
inferredcites →https://doi.org/10.1016/0304-3975(90)90044-iopenalex-snapshot
Improved limitedness theorems on finite automata with distance functions
inferredcites →https://doi.org/10.1016/0304-3975(91)90321-ropenalex-snapshot
Limitedness theorem on finite automata with distance functions: an algebraic proof
inferredcites →https://doi.org/10.1016/0304-3975(91)90381-bopenalex-snapshot
On the degree of ambiguity of finite automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(88)90033-8openalex-snapshot
Algorithms for determining relative star height and star height
inferredcites →https://doi.org/10.1016/0890-5401(90)90053-kopenalex-snapshot
On measuring nondeterminism in regular languages
inferredcites →https://doi.org/10.1016/0890-5401(92)90014-7openalex-snapshot
On the relation between ambiguity and nondeterminism in finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(78)90425-4openalex-snapshot
Finite automata having cost functions: Nondeterministic models
inferredcites →https://doi.org/10.1051/ita/1985190403511openalex-snapshot
Automates de coût borné sur un alphabet à une lettre
inferredcites →https://doi.org/10.1051/ita/1991250100191openalex-snapshot
On finitely generated monoids of matrices with entries in $\mathbb {N}$
inferredcites →https://doi.org/10.1051/ita/1994283-402771openalex-snapshot
On semigroups of matrices over the tropical semiring
inferredcites →https://doi.org/10.1109/sfcs.1978.21openalex-snapshot
Limited subsets of a free monoid
inferredcites →https://doi.org/10.1142/9789814540803openalex-snapshot
Monoids and Semigroups with Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_34openalex-snapshot
On finite automata with limited nondeterminism (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_12openalex-snapshot
The Theory of Stabilisation Monoids and Regular Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_10openalex-snapshot
Limited Non-determinism Hierarchy of Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_9openalex-snapshot
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata
inferred← citeshttps://doi.org/10.1007/s00224-005-1255-xopenalex-snapshot
A Burnside Approach to the Finite Substitution Problem
inferred← citeshttps://doi.org/10.1007/s002360050133openalex-snapshot
On finite automata with limited nondeterminism
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90109-9openalex-snapshot
A note on finitely ambiguous distance automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90287-9openalex-snapshot
Finite-valued distance automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90288-7openalex-snapshot
Exponential upper and lower bounds for the order of a regular language
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.011openalex-snapshot
Bounded regular path queries in view-based data integration
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00260-0openalex-snapshot
New upper bounds to the limitedness of distance automata
inferred← citeshttps://doi.org/10.1051/ita:2005027openalex-snapshot
Distance desert automata and the star height problem
inferred← citeshttps://doi.org/10.1051/ita:2008017openalex-snapshot
A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
inferred← citeshttps://doi.org/10.1109/ideas.2007.20openalex-snapshot
Boundedness of Regular Path Queries in Data Integration Systems
inferred← citeshttps://doi.org/10.1109/ideas.2007.4318092openalex-snapshot
Boundedness of Regular Path Queries in Data Integration Systems
inferred← citeshttps://doi.org/10.25596/jalc-2003-465openalex-snapshot
On the Complexity of Simon Automata over the Dyck Language
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.