On the public citation graph
Quasi-realtime languages
0 signed · 154 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.1002/j.1538-7305.1967.tb03172.xopenalex-snapshot
An Approach to a Unified Theory of Automata
inferredcites →https://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(66)80003-7openalex-snapshot
Turing machines with restricted memory access
inferredcites →https://doi.org/10.1016/s0022-0000(69)80015-2openalex-snapshot
Scattered context grammars
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot
Computer Programming and Formal Systems
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1145/1463822.1463848openalex-snapshot
Application of pushdown-store machines
inferredcites →https://doi.org/10.1145/321466.321475openalex-snapshot
One-way nondeterministic real-time list-storage languages
inferredcites →https://doi.org/10.1145/321495.321503openalex-snapshot
An Infinite Hierarchy of Context-Free Languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19790252506openalex-snapshot
Equivalence of some Hierarchies of Primitive Recursive Functions
inferred← citeshttps://doi.org/10.1007/10703163_2openalex-snapshot
Descriptive Complexity, Lower Bounds and Linear Time
inferred← citeshttps://doi.org/10.1007/11537311_27openalex-snapshot
Shrinking Multi-pushdown Automata
inferred← citeshttps://doi.org/10.1007/3-540-06473-7_11openalex-snapshot
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_1openalex-snapshot
Formal language theory and theoretical computer science
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_26openalex-snapshot
About the derivation languages of grammars and machines
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_35openalex-snapshot
Linear time simulation of multihead turing machines with head — To-head jumps
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_9openalex-snapshot
On the computational power of reversal-bounded machines
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_89openalex-snapshot
Pushdown automata with restricted use of storage symbols
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_91openalex-snapshot
Reversal-bounded and visit-bounded realtime computations
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_38openalex-snapshot
Rudimentary relations and Turing machines with linear alternation
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_13openalex-snapshot
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_34openalex-snapshot
On the power of cooperative concurrency
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_145openalex-snapshot
A note on uniform circuit lower bounds for the counting hierarchy (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4openalex-snapshot
Advances in Algorithms, Languages, and Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_4openalex-snapshot
Homomorphic Representations of Certain Classes of Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-18812-6_1openalex-snapshot
Complexity of One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_17openalex-snapshot
Guarded Traced Categories
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_30openalex-snapshot
Dimension- and Time-Hierarchies for Small Time Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_35openalex-snapshot
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_6openalex-snapshot
Zur Analysenkomplexitaet von Grammatiken und Pushdown-Akzeptoren, die Hilfszaehler Verwenden
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_21openalex-snapshot
Towards a Coalgebraic Chomsky Hierarchy
inferred← citeshttps://doi.org/10.1007/bf00289095openalex-snapshot
A useful lemma for context-free programmed grammars
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf01201276openalex-snapshot
Two-Way Automata and Length-Preserving Homomorphisms
inferred← citeshttps://doi.org/10.1007/bf01371727openalex-snapshot
State-complexity of finite-state devices, state compressibility and incompressibility
inferred← citeshttps://doi.org/10.1007/bf01704917openalex-snapshot
Uniform simulations of nondeterministic real time multitape turing machines
inferred← citeshttps://doi.org/10.1007/bf01744304openalex-snapshot
Compelled operations and operations of degreeP
inferred← citeshttps://doi.org/10.1007/bf01744567openalex-snapshot
Some formal results about stratificational grammars and their relevance to linguistics
inferred← citeshttps://doi.org/10.1007/bf01776575openalex-snapshot
Real-time computations with restricted nondeterminism
inferred← citeshttps://doi.org/10.1007/bfb0012759openalex-snapshot
Extended Chomsky-Schützenberger theorems
inferred← citeshttps://doi.org/10.1007/bfb0017167openalex-snapshot
Two applications of fürer's counter to one-tape nondeterministic TMs
inferred← citeshttps://doi.org/10.1007/bfb0028573openalex-snapshot
Hierarchies of principal twist-closed trios
inferred← citeshttps://doi.org/10.1007/bfb0052082openalex-snapshot
On twist-closed trios: A new morphic characterization of r.e. sets
inferred← citeshttps://doi.org/10.1007/bfb0055110openalex-snapshot
Efficient simulations by queue machines
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90179-2openalex-snapshot
Alternating real-time computations
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90212-8openalex-snapshot
Some considerations about npriority(1) without rom
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90010-7openalex-snapshot
Stack languages and log n space
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90026-4openalex-snapshot
Multiple equality sets and post machines
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90047-5openalex-snapshot
Simulating two pushdown stores by one tape in 0(n1.5√log n) time
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90036-6openalex-snapshot
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90082-7openalex-snapshot
On the pre-AFL of [log n] space and related families of languages
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90020-8openalex-snapshot
Remarks on blind and partially blind one-way multicounter machines
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90053-7openalex-snapshot
Partial commutations and faithful rational transductions
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90103-4openalex-snapshot
Representations of language families by homomorphic equality operations and generalized equality sets
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90115-0openalex-snapshot
A note on: ‘Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages’ (by K. Ayers)
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00078-xopenalex-snapshot
Separating classes in the exponential-time hierarchy from classes in PH
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90040-mopenalex-snapshot
Diagonalization, uniformity, and fixed-point theorems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.05.014openalex-snapshot
Fragments of Monadic Second-Order Logics Over Word Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.027openalex-snapshot
Observations on complete sets between linear time and polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.029openalex-snapshot
Quasi-rocking real-time pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.038openalex-snapshot
Weighted restarting automata and pushdown relations
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)80004-9openalex-snapshot
A note on AFLs and bounded erasing
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90302-0openalex-snapshot
Characteristic and ultrarealtime languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)80002-7openalex-snapshot
Erasable context-free languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90257-7openalex-snapshot
The bounded arithmetic hierarchy
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90289-9openalex-snapshot
Visits, crosses, and reversals for nondeterministic off-line machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90090-xopenalex-snapshot
On the power of two-dimensional grammars which are not length consistent
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80019-4openalex-snapshot
Two nonlinear lower bounds for on-line computations
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80029-7openalex-snapshot
Alternation bounded auxiliary pushdown automata
inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80031-9openalex-snapshot
Time- and tape-bounded turing acceptors and AFLs
inferred← citeshttps://doi.org/10.1016/s0022-0000(71)80025-9openalex-snapshot
Time-bounded grammars and their languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80039-4openalex-snapshot
Syntactic operators on full semiAFLs
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80044-3openalex-snapshot
On the extension of Gladkij's Theorem and the Hierarchies of languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80008-5openalex-snapshot
Comparing complexity classes
inferred← citeshttps://doi.org/10.1016/s0022-0000(77)80026-3openalex-snapshot
Control sets on context-free grammar forms
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70471-3openalex-snapshot
Bounded Arithmetic Formulas and Turing Machines of Constant Alternation
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00272-9openalex-snapshot
Deterministic Turing machines in the range between real-time and linear-time
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00028-5openalex-snapshot
Dynamical recognizers: real-time language recognition by analog computers
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00105-9openalex-snapshot
Language complexity of rotations and Sturmian sequences
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00087-7openalex-snapshot
Refining the hierarchy of blind multicounter languages and twist-closed trios
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.009openalex-snapshot
Turing and the development of computational complexity
inferred← citeshttps://doi.org/10.1051/ita/1977110100291openalex-snapshot
Cônes rationnels commutativement clos
inferred← citeshttps://doi.org/10.1051/ita/1977110100531openalex-snapshot
Characterizations of the Dyck sets
inferred← citeshttps://doi.org/10.1051/ita/1978120403691openalex-snapshot
The independence of certain operations on semiAFLs
inferred← citeshttps://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/1983170201211openalex-snapshot
Space classes, intersection of languages and bounded erasing homomorphisms
inferred← citeshttps://doi.org/10.1080/00207168408803437openalex-snapshot
On characterisation of language families in terms of inverse morphisms
inferred← citeshttps://doi.org/10.1080/03081079.2012.695896openalex-snapshot
Non-deterministic cellular automata and languages
inferred← citeshttps://doi.org/10.1109/ccc.2001.933896openalex-snapshot
Time-space tradeoffs in the counting hierarchy
inferred← citeshttps://doi.org/10.1109/itng.2011.167openalex-snapshot
Sublinear Space Real-Time Turing Machines Cannot Count
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sct.1993.336523openalex-snapshot
Complexity and structure in formal language theory
inferred← citeshttps://doi.org/10.1109/sct.1994.315818openalex-snapshot
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
inferred← citeshttps://doi.org/10.1109/sct.1995.514727openalex-snapshot
On superlinear lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1109/sfcs.1985.50openalex-snapshot
Simulating two pushdown stores by one tape in O(n1.5v) time
inferred← citeshttps://doi.org/10.1109/swat.1973.25openalex-snapshot
Refinements of the nondeterministic time and space hierarchies
inferred← citeshttps://doi.org/10.1109/t-c.1975.224294openalex-snapshot
A Remark on Code Sets and Context-Free Languages
inferred← citeshttps://doi.org/10.1137/0201019openalex-snapshot
On Languages Accepted in Polynomial Time
inferred← citeshttps://doi.org/10.1137/0201024openalex-snapshot
Real-Time Strict Deterministic Languages
inferred← citeshttps://doi.org/10.1137/0203023openalex-snapshot
Reversal-Bounded Acceptors and Intersections of Linear Languages
inferred← citeshttps://doi.org/10.1137/0203024openalex-snapshot
Existence of Graphs with Three Spanning Trees and Given Degree Sequence
inferred← citeshttps://doi.org/10.1137/0207016openalex-snapshot
Linear Languages and the Intersection Closures of Classes of Languages
inferred← citeshttps://doi.org/10.1137/0207018openalex-snapshot
Rudimentary Predicates and Relative Computation
inferred← citeshttps://doi.org/10.1137/0213016openalex-snapshot
Two Tapes are Better than One for Nondeterministic Machines
inferred← citeshttps://doi.org/10.1137/0213025openalex-snapshot
The Spectra of First-Order Sentences and Computational Complexity
inferred← citeshttps://doi.org/10.1137/s0097539793251888openalex-snapshot
Linear Time and Memory-Efficient Computation
inferred← citeshttps://doi.org/10.1137/s0097539799350608openalex-snapshot
Efficient Simulations by Queue Machines
inferred← citeshttps://doi.org/10.1142/s0129054107004723openalex-snapshot
SHRINKING RESTARTING AUTOMATA
inferred← citeshttps://doi.org/10.1145/12130.12135openalex-snapshot
On nontrivial separators for k -page graphs and simulations by nondeterministic one-tape Turing machines
inferred← citeshttps://doi.org/10.1145/1478873.1478986openalex-snapshot
Theory of computing in computer science education
inferred← citeshttps://doi.org/10.1145/176584.176587openalex-snapshot
On the power of bounded concurrency I
inferred← citeshttps://doi.org/10.1145/3372880openalex-snapshot
Toward a Uniform Theory of Effectful State Machines
inferred← citeshttps://doi.org/10.1145/800070.802171openalex-snapshot
Two tapes are better than one for nondeterministic machines
inferred← citeshttps://doi.org/10.1145/800105.803407openalex-snapshot
Computations with a restricted number of nondeterministic steps (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800119.803903openalex-snapshot
Some restrictions on W-grammars
inferred← citeshttps://doi.org/10.1145/800119.803906openalex-snapshot
Intersections of linear context-free languages and reversal-bounded multipushdown machines (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800125.804030openalex-snapshot
On the time and tape complexity of languages I
inferred← citeshttps://doi.org/10.1145/800125.804031openalex-snapshot
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition---(Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800161.805154openalex-snapshot
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)
inferred← citeshttps://doi.org/10.22029/jlupub-7007openalex-snapshot
Deterministic Turing machines in the range between real-time and linear-time
inferred← citeshttps://doi.org/10.3103/s1066369x14090096openalex-snapshot
Computational power of one-way turing machines with sublogarithmic memory restrictions
inferred← citeshttps://doi.org/10.31274/rtd-180813-10619openalex-snapshot
On the structure of intractable sets
inferred← citeshttps://doi.org/10.3233/fi-1996-253408openalex-snapshot
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
inferred← citeshttps://doi.org/10.3233/fi-2011-587openalex-snapshot
Growing Grammars and Length-reducing Automata
inferred← citeshttps://doi.org/10.4086/cjtcs.1999.007openalex-snapshot
The Permanent Requires Large Uniform Threshold Circuits.
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00975openalex-snapshot
Some Remarks on Real-Time Turing Machines
inferred← citeshttps://doi.org/10.70675/6466009fz6cb0z4f56z95a2zb45685141114openalex-snapshot
Langages ε-sûrs et caractérisations des langages d'ordres supérieurs
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.