Finite-turn checking automata (Q2550634): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multitape one-way nonwriting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in abstract families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unsolvability of the Recognition of Linear Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equal matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Semilinear Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous equal matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5647882 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:44, 12 June 2024

scientific article
Language Label Description Also known as
English
Finite-turn checking automata
scientific article

    Statements

    Identifiers