Abstract families of deterministic languages

DOI10.1145/800169.805418zbMATH Open1282.68153OpenAlexW1978349975MaRDI QIDQ5402502FDOQ5402502

Authors: W. J. Chandler 

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800169.805418

Recommendations

• scientific article; zbMATH DE number 1101592
• scientific article; zbMATH DE number 3868645
• scientific article; zbMATH DE number 4047163
• Abstract families of processors
• On operations over language families

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (15)

• On inverse deterministic pushdown transductions
• Characterizations and computational complexity of systolic trellis automata
• A characterization of two-way deterministic classes of languages
• One-way acceptors and languages
• Title not available (Why is that?)
• Studies in abstract families of languages
• LR-regular grammars - an extension of LR(k) grammars
• Title not available (Why is that?)
• Opérations de cylindre et applications séquentielles gauches inverses
• Deterministic biautomata and subclasses of deterministic linear languages
• Title not available (Why is that?)
• On decision problems concerning contextual insertions and deletions
• Title not available (Why is that?)
• Abstract families of processors
• Characterizations of transductions defined by abstract families of transducers

This page was built for publication: Abstract families of deterministic languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402502)