On the public citation graph
Algebraic decision procedures for local testability
0 signed · 131 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.1016/s0012-365x(73)80005-6openalex-snapshot
Characterizations of locally testable events
inferredcites →https://doi.org/10.1016/s0022-0000(72)80020-5openalex-snapshot
Locally testable languages
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1109/pgec.1963.263534openalex-snapshot
The Theory of Definite Automata
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1071openalex-snapshot
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications
inferred← citeshttps://doi.org/10.1007/11564096_31openalex-snapshot
Learning (k,l)-Contextual Tree Languages for Information Extraction
inferred← citeshttps://doi.org/10.1007/11872436_11openalex-snapshot
Learning Analysis by Reduction from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_205openalex-snapshot
Semigroup characterizations of some language varieties
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_25openalex-snapshot
Une caracterisation de trois varietes de langages bien connues
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_49openalex-snapshot
Languages of nilpotent and solvable groups (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_86openalex-snapshot
On some properties of local testability
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_91openalex-snapshot
Semigroups and languages of dot-depth 2
inferred← citeshttps://doi.org/10.1007/3-540-44977-9_22openalex-snapshot
A Package TESTAS for Checking Some Kinds of Testability
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_35openalex-snapshot
A polynomial time algorithm for the local testability problem of deterministic finite automata
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_7openalex-snapshot
An upper bound on the order of locally testable deterministic finite automata
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_66openalex-snapshot
A purely algebraic proof of McNaughton's theorem on infinite words
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_69openalex-snapshot
Computing the order of a locally testable automaton
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_60openalex-snapshot
Locally threshold testable languages of infinite words
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_92openalex-snapshot
The product of rational languages
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_49openalex-snapshot
How to invent characterizable inference methods for regular languages
inferred← citeshttps://doi.org/10.1007/3-540-58473-0_147openalex-snapshot
The algorithms RT and k-TTI: A first comparison
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-030-10801-4_23openalex-snapshot
Multi-stranded String Assembling Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_19openalex-snapshot
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-87993-8_7openalex-snapshot
String Assembling Systems: Comparison to Sticker Systems and Decidability
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_22openalex-snapshot
Measuring Power of Locally Testable Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_21openalex-snapshot
Measuring Power of Generalised Definite Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-97274-4_13openalex-snapshot
String Assembling Systems: Origins and Directions
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot
Seventy Years of Algebraic, Logical, and Topological Methods for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_14openalex-snapshot
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_14openalex-snapshot
A Note on Decidable Separability by Piecewise Testable Languages
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-94-010-1917-0_25openalex-snapshot
On a Family of Rational Languages
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_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/bf01212963openalex-snapshot
NC1: The automata-theoretic viewpoint
inferred← citeshttps://doi.org/10.1007/bf01762671openalex-snapshot
Group-complexity and reversals of finite semigroups
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/bf02572744openalex-snapshot
The varieties of n-testable semigroups
inferred← citeshttps://doi.org/10.1007/bf03325439openalex-snapshot
Free profinite R-trivial, locally idempotent and locally commutative semigroups
inferred← citeshttps://doi.org/10.1007/bfb0030882openalex-snapshot
An efficient algorithm for local testability problem of finite state automata
inferred← citeshttps://doi.org/10.1007/bfb0031380openalex-snapshot
LANGAGE: A Maple package for automaton characterization of regular languages
inferred← citeshttps://doi.org/10.1007/bfb0033340openalex-snapshot
Inductive inference from positive data: from heuristic to characterizing methods
inferred← citeshttps://doi.org/10.1007/pl00005913openalex-snapshot
Equations on Semidirect Products of Commutative Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-018-9916-7openalex-snapshot
Left and right negatively orderable semigroups and a one-sided version of Simon’s theorem
inferred← citeshttps://doi.org/10.1007/s00233-019-09999-8openalex-snapshot
The influence of Imre Simon’s work in the theory of automata, languages and semigroups
inferred← citeshttps://doi.org/10.1007/s002330010098openalex-snapshot
Some key problems on finite semigroups
inferred← citeshttps://doi.org/10.1007/s10710-006-7008-zopenalex-snapshot
Introducing lateral thinking in search engines
inferred← citeshttps://doi.org/10.1007/s10849-018-9270-xopenalex-snapshot
The Expressivity of Autosegmental Grammars
inferred← citeshttps://doi.org/10.1007/s10994-008-5049-7openalex-snapshot
Learning (k,l)-contextual tree languages for information extraction from web pages
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90045-1openalex-snapshot
On generalized locally testable languages
inferred← citeshttps://doi.org/10.1016/0021-8693(75)90184-2openalex-snapshot
The Burnside problem for semigroups
inferred← citeshttps://doi.org/10.1016/0021-8693(78)90249-1openalex-snapshot
La finitude des représentations linéaires des semi-groupes est décidable
inferred← citeshttps://doi.org/10.1016/0022-4049(85)90062-3openalex-snapshot
Finite semigroup varieties of the form V ∗ D
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00047-uopenalex-snapshot
Inclusion relations between some congruences related to the dot-depth hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90006-8openalex-snapshot
UN algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90029-1openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90034-5openalex-snapshot
Semigroups and languages of dot-depth two
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90019-eopenalex-snapshot
Products of languages with counter
inferred← citeshttps://doi.org/10.1016/0898-1221(89)90179-xopenalex-snapshot
Games, equations and the dot-depth hierarchy
inferred← citeshttps://doi.org/10.1016/b978-0-12-198820-3.50016-4openalex-snapshot
CONCATENATION HIERARCHIES DECIDABILITY RESULTS AND PROBLEMS
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.ic.2017.09.006openalex-snapshot
On the descriptional complexity of stateless deterministic ordered restarting automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.002openalex-snapshot
Grammatical inference of directed acyclic graph languages with polynomial time complexity
inferred← citeshttps://doi.org/10.1016/j.jpaa.2006.06.016openalex-snapshot
Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.08.009openalex-snapshot
Infinite-vertex free profinite semigroupoids and symbolic dynamics
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.043openalex-snapshot
On bases of identities for the ω -variety generated by locally testable semigroups
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.058openalex-snapshot
From regular expressions to smaller NFAs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.023openalex-snapshot
Local testability from words to traces, a suitable definition
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90821-3openalex-snapshot
On a question of McNaughton and Papert
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90180-1openalex-snapshot
A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80007-4openalex-snapshot
Properties of code events and homomorphisms over regular events
inferred← citeshttps://doi.org/10.1016/s0022-4049(00)00176-6openalex-snapshot
Free profinite locally idempotent and locally commutative semigroups
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)60380-3openalex-snapshot
Chapter VIII Examples of Varieties of Sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00372-9openalex-snapshot
Biinfinite words with maximal recurrent unbordered factors
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00332-6openalex-snapshot
Families of locally testable languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00013-4openalex-snapshot
LANGAGE: A maple package for automaton characterization of regular languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00108-5openalex-snapshot
Right and left locally testable languages
inferred← citeshttps://doi.org/10.1051/ita/197610r200331openalex-snapshot
Hierarchies of aperiodic languages
inferred← citeshttps://doi.org/10.1051/ita/1980140100391openalex-snapshot
On some properties of the syntactic semigroup of a very pure subsemigroup
inferred← citeshttps://doi.org/10.1051/ita/2013048openalex-snapshot
Bidirectional string assembling systems
inferred← citeshttps://doi.org/10.1051/ita:1999105openalex-snapshot
Strongly locally testable semigroups with commuting idempotents and related languages
inferred← citeshttps://doi.org/10.1051/ita:2005001openalex-snapshot
The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
inferred← citeshttps://doi.org/10.1051/ita:2007063openalex-snapshot
Hierarchies and reducibilities on regular languages related to modulo counting
inferred← citeshttps://doi.org/10.1080/00927872.2021.1931263openalex-snapshot
The Karoubi envelope of the mirage of a subshift
inferred← citeshttps://doi.org/10.1081/agb-120016005openalex-snapshot
THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
inferred← citeshttps://doi.org/10.1109/12.93741openalex-snapshot
A polynomial time algorithm for the local testability problem of deterministic finite automata
inferred← citeshttps://doi.org/10.1109/34.57687openalex-snapshot
Inference of k-testable languages in the strict sense and application to syntactic pattern recognition
inferred← citeshttps://doi.org/10.1109/tpami.2005.147openalex-snapshot
Probabilistic finite-state machines - part I
inferred← citeshttps://doi.org/10.1109/tpami.2005.148openalex-snapshot
Probabilistic finite-state machines - part II
inferred← citeshttps://doi.org/10.1137/s0097539791216987openalex-snapshot
Computing the Order of a Locally Testable Automaton
inferred← citeshttps://doi.org/10.1142/9789812792310_0005openalex-snapshot
SOME VARIATIONS ON THE NOTION OF LOCALLY TESTABLE LANGUAGE
inferred← citeshttps://doi.org/10.1142/9789813148208_0007openalex-snapshot
Open Problems About Regular Languages, 35 Years Later
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.1142/s0129054110007556openalex-snapshot
ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054121420053openalex-snapshot
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1142/s0218196704001955openalex-snapshot
TAMENESS OF THE PSEUDOVARIETY LS1
inferred← citeshttps://doi.org/10.1142/s0218196708004676openalex-snapshot
GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE
inferred← citeshttps://doi.org/10.1142/s0218196712500609openalex-snapshot
TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES
inferred← citeshttps://doi.org/10.1145/322092.322098openalex-snapshot
Noncounting Context-Free Languages
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
inferred← citeshttps://doi.org/10.1201/9780203009642.ch24openalex-snapshot
Threshold Locally Testable Languages in Strict Sense
inferred← citeshttps://doi.org/10.1515/tl-2022-2037openalex-snapshot
Subregular linguistics: bridging theoretical linguistics and formal grammar
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:24)2014openalex-snapshot
On Separation by Locally Testable and Locally Threshold Testable Languages
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.23638/dmtcs-19-4-1openalex-snapshot
A Characterization for Decidable Separability by Piecewise Testable Languages
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.363openalex-snapshot
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.230openalex-snapshot
Separability by Short Subsequences and Subwords
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:4)2023openalex-snapshot
Locality and Centrality: The Variety ZG
inferred← citeshttps://doi.org/10.48550/arxiv.1709.10052openalex-snapshot
Adding successor: A transfer theorem for separation and covering
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.