On the public citation graph

Polynomial operations on rational languages

0 signed · 58 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-07407-4_23openalex-snapshot

Piecewise testable events

inferredcites →https://doi.org/10.1007/978-1-4613-2215-3openalex-snapshot

Varieties of Formal Languages

inferredcites →https://doi.org/10.1007/bf02194921openalex-snapshot

Sur Le Produit De Concatenation Non Ambigu

inferredcites →https://doi.org/10.1007/bf02574198openalex-snapshot

Recognizable sets and power sets of finite semigroups

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(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/0022-0000(86)90037-1openalex-snapshot

First-order logic and star-free sets

inferredcites →https://doi.org/10.1016/0022-4049(79)90025-2openalex-snapshot

Aperiodic homomorphisms and the concatenation product of recognizable sets

inferredcites →https://doi.org/10.1016/0022-4049(85)90062-3openalex-snapshot

Finite semigroup varieties of the form V ∗ D

inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50007-5openalex-snapshot

OPEN PROBLEMS ABOUT REGULAR LANGUAGES11Research supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-1617. Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.

inferredcites →https://doi.org/10.1016/s0019-9958(82)91028-2openalex-snapshot

Regular languages of star height one

inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot

Automata, Languages, and Machines

inferredcites →https://doi.org/10.1051/ita/1984180100231openalex-snapshot

Hiérarchies de concaténation

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-46011-x_21openalex-snapshot

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot

Polynomial closure and unambiguous product

inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_20openalex-snapshot

Characterizing Level One in Group-Based Concatenation Hierarchies

inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_25openalex-snapshot

How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?

inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_21openalex-snapshot

On the State Complexity of Closures and Interiors of Regular Languages with Subwords

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-319-58747-9_5openalex-snapshot

Concatenation Hierarchies: New Bottle, Old Wine

inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_13openalex-snapshot

The Common Fragment of ACTL and LTL

inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_3openalex-snapshot

Theme and Variations on the Concatenation Product

inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_29openalex-snapshot

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_14openalex-snapshot

Quantifier Alternation for Infinite Words

inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot

Logic, semigroups and automata on words

inferred← citeshttps://doi.org/10.1007/bf02679467openalex-snapshot

Polynomial closure and unambiguous product

inferred← citeshttps://doi.org/10.1007/bfb0055073openalex-snapshot

Bridges for concatenation hierarchies

inferred← citeshttps://doi.org/10.1007/s00224-007-9002-0openalex-snapshot

Languages of Dot-Depth 3/2

inferred← citeshttps://doi.org/10.1007/s00224-018-9867-0openalex-snapshot

Generic Results for Concatenation Hierarchies

inferred← citeshttps://doi.org/10.1007/s00233-026-10611-zopenalex-snapshot

A purely algebraic proof of the omega-reducibility of pseudovarieties representing low half levels of concatenation hierarchies

inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.012openalex-snapshot

A note on partially ordered tree automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.028openalex-snapshot

On the state complexity of closures and interiors of regular languages with subwords and superwords

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00230-4openalex-snapshot

Algebraic tools for the concatenation product

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00342-5openalex-snapshot

Some complexity results for polynomial rational expressions

inferred← citeshttps://doi.org/10.1051/ita:2001134openalex-snapshot

A conjecture on the concatenation product

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.1109/lics.2015.28openalex-snapshot

Separating Regular Languages with Two Quantifiers Alternations

inferred← citeshttps://doi.org/10.1109/lics.2017.8005070openalex-snapshot

Separation for dot-depth two

inferred← citeshttps://doi.org/10.1109/lics.2019.8785655openalex-snapshot

Separation and covering for group based concatenation hierarchies

inferred← citeshttps://doi.org/10.1109/lics65433.2025.00031openalex-snapshot

Navigational hierarchies of regular languages

inferred← citeshttps://doi.org/10.1142/9789812708700_0004openalex-snapshot

OPEN PROBLEMS ON REGULAR LANGUAGES: A HISTORICAL PERSPECTIVE

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/s0218196724500024openalex-snapshot

The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies

inferred← citeshttps://doi.org/10.1145/2528928openalex-snapshot

Enumeration of monadic second-order queries on trees

inferred← citeshttps://doi.org/10.1145/2815493.2815495openalex-snapshot

The tale of the quantifier alternation hierarchy of first-order logic over words

inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot

Going Higher in First-Order Quantifier Alternation Hierarchies on Words

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.23638/lmcs-14(3:1)2018openalex-snapshot

The Covering Problem

inferred← citeshttps://doi.org/10.23638/lmcs-14(4:16)2018openalex-snapshot

Separating regular languages with two quantifier alternations

inferred← citeshttps://doi.org/10.4204/eptcs.151.3openalex-snapshot

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)

inferred← citeshttps://doi.org/10.48550/arxiv.1404.6832openalex-snapshot

Going higher in the First-order Quantifier Alternation Hierarchy on Words

inferred← citeshttps://doi.org/10.48550/arxiv.1511.09011openalex-snapshot

Quantifier Alternation for Infinite Words

inferred← citeshttps://doi.org/10.48550/arxiv.2008.11635openalex-snapshot

Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic

inferred← citeshttps://doi.org/10.48550/arxiv.cs/9809118openalex-snapshot

The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy

inferred← citeshttps://doi.org/10.5555/3329995.3330005openalex-snapshot

Separation for dot-depth two

inferred← citeshttps://doi.org/10.70675/6c9d51cbze0efz4fdezb9b8z4ddc2f8fce0fopenalex-snapshot

Subwords : automata, embedding problems, and verification

inferred← citeshttps://doi.org/10.70675/82bb9f24z8517z463az8bc9zadcf1a50805fopenalex-snapshot

Synchronous relations and complexity of query evaluation

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.