On the public citation graph

Factors of words

https://doi.org/10.1007/bfb0035752
0 signed · 68 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-15641-0_19openalex-snapshot
An introduction to finite automata on infinite words
inferredcites →https://doi.org/10.1007/3-540-15641-0_21openalex-snapshot
Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme
inferredcites →https://doi.org/10.1007/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferredcites →https://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferredcites →https://doi.org/10.1007/3-540-17179-7_14openalex-snapshot
Thin homogeneous sets of factors
inferredcites →https://doi.org/10.1007/978-1-4613-2215-3openalex-snapshot
Varieties of Formal Languages
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bf01351676openalex-snapshot
The theory of successor with an extra predicate
inferredcites →https://doi.org/10.1007/bf01761708openalex-snapshot
Algebraic decision procedures for local testability
inferredcites →https://doi.org/10.1007/bfb0015728openalex-snapshot
About rational sets of factors of a bi-infinite word
inferredcites →https://doi.org/10.1007/bfb0030294openalex-snapshot
Recent results on automata and infinite words
inferredcites →https://doi.org/10.1007/bfb0036941openalex-snapshot
Varietes de semigroupes et mots infinis
inferredcites →https://doi.org/10.1016/0012-365x(82)90281-3openalex-snapshot
Book announcements
inferredcites →https://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
inferredcites →https://doi.org/10.1016/0022-0000(86)90037-1openalex-snapshot
First-order logic and star-free sets
inferredcites →https://doi.org/10.1016/0022-4049(85)90071-4openalex-snapshot
Graph congruences and wreath products
inferredcites →https://doi.org/10.1016/0304-3975(84)90095-1openalex-snapshot
Bilimites de langages reconnaissables
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/0304-3975(86)90136-2openalex-snapshot
On the complementation of Büchi automata
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50008-5openalex-snapshot
ON RICH WORDS
inferredcites →https://doi.org/10.1016/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0019-9958(77)90443-0openalex-snapshot
Application of model theoretic games to discrete linear orders and finite automata
inferredcites →https://doi.org/10.1016/s0019-9958(79)90629-6openalex-snapshot
Star-free regular sets of ω-sequences
inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
inferredcites →https://doi.org/10.4153/cjm-1986-025-6openalex-snapshot
Ensembles Reconnaissables de Mots Biinfinis
inferredcites →https://doi.org/10.5860/choice.43-3144openalex-snapshot
Encyclopedia of mathematics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11538363_20openalex-snapshot
Towards a Characterization of Order-Invariant Queries over Tame Structures
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_33openalex-snapshot
Piecewise and Local Threshold Testability of DFA
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_48openalex-snapshot
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_14openalex-snapshot
Reducing the Time Complexity of Testing for Local Threshold Testability
inferred← citeshttps://doi.org/10.1007/3-540-45526-4_15openalex-snapshot
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_154openalex-snapshot
On logics, tilings, and automata
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_166openalex-snapshot
An EILENBERG theorem for ∞-languages
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_155openalex-snapshot
Monadic second-order logic over pictures and recognizability by tiling systems
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_137openalex-snapshot
The expressive power of existential first order sentences of büchi's sequential calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_27openalex-snapshot
Regular Tree Languages Definable in FO
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_24openalex-snapshot
A Decidable Characterization of Locally Testable Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_12openalex-snapshot
Automata vs. Logics on Data Words
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_4openalex-snapshot
A Toolkit for Proving Limitations of the Expressive Power of Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_5openalex-snapshot
Logics for Regular Languages, Finite Monoids, and Circuit Complexity
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_16openalex-snapshot
System Description: A Theorem-Prover for Subregular Systems: The Language Toolkit and Its Interpreter, Plebby
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/s10849-023-09398-xopenalex-snapshot
Relativized Adjacency
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90258-4openalex-snapshot
Languages and scanners
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.027openalex-snapshot
Expressive power of existential first-order sentences of Büchi's sequential calculus
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.015openalex-snapshot
A new algorithm for testing if a regular language is locally threshold testable
inferred← citeshttps://doi.org/10.1109/lics.2010.16openalex-snapshot
Addition-Invariant FO and Regularity
inferred← citeshttps://doi.org/10.1137/110856873openalex-snapshot
Locality from Circuit Lower Bounds
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/1456650.1456653openalex-snapshot
XPath leashed
inferred← citeshttps://doi.org/10.1145/1614431.1614435openalex-snapshot
Regular tree languages definable in FO and in FO mod
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
inferred← citeshttps://doi.org/10.15398/jlm.v9i1.262openalex-snapshot
Typology emerges from simplicity in representations and learning
inferred← citeshttps://doi.org/10.17877/de290r-17260openalex-snapshot
Logics on data words
inferred← citeshttps://doi.org/10.2168/lmcs-7(4:3)2011openalex-snapshot
A decidable characterization of locally testable tree languages
inferred← citeshttps://doi.org/10.2178/jsl/1231082307openalex-snapshot
Towards a characterization of order-invariant queries over tame graphs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2012.489openalex-snapshot
Regular tree languages, cardinality predicates, and addition-invariant FO
inferred← citeshttps://doi.org/10.46298/dmtcs.406openalex-snapshot
Regular languages and associative language descriptions
inferred← citeshttps://doi.org/10.48550/arxiv.2106.02312openalex-snapshot
Verification Tools for Checking some kinds of Testability
inferred← citeshttps://doi.org/10.5555/1756384.1756408openalex-snapshot
A package TESTAS for checking some kinds of testability
inferred← citeshttps://doi.org/10.70675/984fba72z6266z4f52z9948z528cadd946cbopenalex-snapshot
Decidable characterizations for tree logics
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.