On the public citation graph

Formal Properties of Finite Automata and Applications

https://doi.org/10.1007/bfb0013106
0 signed · 45 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11961239_17openalex-snapshot
A New Model for Classifying DNA Code Inspired by Neural Networks and FSA
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_29openalex-snapshot
Logical specifications of infinite computations
inferred← citeshttps://doi.org/10.1007/978-1-4612-1388-8_6openalex-snapshot
Ordered Monoids and J-Trivial Monoids
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_6openalex-snapshot
Language Equivalence from Nondeterministic to Weighted Automata—and Back
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_10openalex-snapshot
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_47openalex-snapshot
Regular Temporal Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_52openalex-snapshot
Weak Cost Monadic Logic over Infinite Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-35606-3_74openalex-snapshot
Algorithms Based on Finite Automata for Testing of Z-codes
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_29openalex-snapshot
Algebras, Automata and Logic for Languages of Labeled Birooted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_10openalex-snapshot
Syntactic Semigroups
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_1openalex-snapshot
Finite Semigroups and Recognizable Languages: An Introduction
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_2openalex-snapshot
BG = PG: A Success Story
inferred← citeshttps://doi.org/10.1007/bf02573404openalex-snapshot
On the membership problem for pseudovarieties of commutative semigroups
inferred← citeshttps://doi.org/10.1007/bf02574101openalex-snapshot
The joint of the pseudovarieties of idempotent semigroups and locally trivial semigroups
inferred← citeshttps://doi.org/10.1007/bf02679444openalex-snapshot
Regular Languages and Stone Duality
inferred← citeshttps://doi.org/10.1007/bf03011618openalex-snapshot
A class of semisimple automata
inferred← citeshttps://doi.org/10.1007/bf03546065openalex-snapshot
Obituary - Marcel-Paul Schützenberger (1920–1996)
inferred← citeshttps://doi.org/10.1007/bfb0020787openalex-snapshot
Rational relations with bounded delay
inferred← citeshttps://doi.org/10.1007/bfb0023779openalex-snapshot
Quantifier hierarchies over word relations
inferred← citeshttps://doi.org/10.1007/bfb0055073openalex-snapshot
Bridges for concatenation hierarchies
inferred← citeshttps://doi.org/10.1007/s00233-008-9122-0openalex-snapshot
The rank of the endomorphism monoid of a uniform partition
inferred← citeshttps://doi.org/10.1007/s10474-009-8025-1openalex-snapshot
The generalized Szendrei expansion of an ℜ-unipotent semigroup
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90029-iopenalex-snapshot
Closure of varieties of languages under products with counter
inferred← citeshttps://doi.org/10.1016/0022-4049(91)90019-xopenalex-snapshot
Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90090-3openalex-snapshot
Infinite trees and automaton- definable relations over ω-words
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90230-qopenalex-snapshot
Synchronized rational relations of finite and infinite words
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90276-3openalex-snapshot
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00100-xopenalex-snapshot
Over testable languages
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00104-2openalex-snapshot
Local languages and the Berry-Sethi algorithm
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.030openalex-snapshot
Cayley graphs as classifiers for data mining: The influence of asymmetries
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.016openalex-snapshot
On labeled birooted tree languages: Algebras, automata and logic
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.004openalex-snapshot
Languages polylog-time reducible to dot-depth 1/2
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.015openalex-snapshot
Machine semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00544-3openalex-snapshot
On congruences of automata defined by directed graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00864-2openalex-snapshot
Equational theories of tropical semirings
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00106-5openalex-snapshot
Nonnegative companion matrices and star-height of N-rational series
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00120-xopenalex-snapshot
Polynomial closure of group languages and open sets of the Hall topology
inferred← citeshttps://doi.org/10.1017/cbo9780511661877.009openalex-snapshot
Finite semigroups as categories, ordered semigroups or compact semigroups
inferred← citeshttps://doi.org/10.1017/s0305004100075332openalex-snapshot
Semigroups whose idempotents form a subsemigroup
inferred← citeshttps://doi.org/10.1080/0020716021000049765openalex-snapshot
Two algorithms for languages recognized by graph algebras
inferred← citeshttps://doi.org/10.1080/00207160214649openalex-snapshot
Two Algorithms For Languages Recognized By Graph Algebras
inferred← citeshttps://doi.org/10.1080/00207169908804865openalex-snapshot
From regular expressions to finite automata∗
inferred← citeshttps://doi.org/10.1142/s0129054108005802openalex-snapshot
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
inferred← citeshttps://doi.org/10.1145/2933575.2934502openalex-snapshot
Games with bound guess actions
inferred← citeshttps://doi.org/10.26713/cma.v13i1.1704openalex-snapshot
Automata in Chinese Remainder Theorem
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.